Dualizing Distance-Hereditary Graphs

Autor: McKee Terry A.
Jazyk: angličtina
Rok vydání: 2021
Předmět:
Zdroj: Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 285-296 (2021)
Druh dokumentu: article
ISSN: 2083-5892
DOI: 10.7151/dmgt.2192
Popis: 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 duality. The resulting “DH* graphs” are characterized and then analyzed in terms of connectivity. These results are used in a special case of plane-embedded graphs to justify viewing DH* graphs as the duals of distance-hereditary graphs.
Databáze: Directory of Open Access Journals