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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
University of Zielona Góra
2021-02-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2192 |
| Tags: |
No Tags, Be the first to tag this record!
|