Dualizing Distance-Hereditary Graphs
Distance-hereditary graphs can be characterized by every cycle of length at least 5 having crossing chords. This makes distance-hereditary graphs susceptible to dualizing, using the common extension of geometric face/vertex planar graph duality to cycle/cutset duality as in abstract matroidal dualit...
Main Author: | McKee Terry A. |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2021-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2192 |
Similar Items
-
Orientable ℤN-Distance Magic Graphs
by: Cichacz Sylwia, et al.
Published: (2019-05-01) -
Hamilton cycles in almost distance-hereditary graphs
by: Chen Bing, et al.
Published: (2016-01-01) -
Strongly Unichord-Free Graphs
by: McKee Terry A.
Published: (2019-05-01) -
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
by: McKee Terry A.
Published: (2018-02-01) -
2-Distance Colorings of Integer Distance Graphs
by: Benmedjdoub Brahim, et al.
Published: (2019-05-01)