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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
University of Zielona Góra
2021-02-01
|
| Schriftenreihe: | Discussiones Mathematicae Graph Theory |
| Schlagworte: | |
| Online-Zugang: | https://doi.org/10.7151/dmgt.2192 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|