Pairs Of Edges As Chords And As Cut-Edges
Several authors have studied the graphs for which every edge is a chord of a cycle; among 2-connected graphs, one characterization is that the deletion of one vertex never creates a cut-edge. Two new results: among 3-connected graphs with minimum degree at least 4, every two adjacent edges are chord...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
University of Zielona Góra
2014-11-01
|
| Col·lecció: | Discussiones Mathematicae Graph Theory |
| Matèries: | |
| Accés en línia: | https://doi.org/10.7151/dmgt.1755 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|