- Tytuł:
- Dualizing Distance-Hereditary Graphs
- Autorzy:
- McKee, Terry A.
- Powiązania:
- https://bibliotekanauki.pl/articles/32083836.pdf
- Data publikacji:
- 2021-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
distance-hereditary graph
dual graph
graph duality - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2021, 41, 1; 285-296
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł