- Tytuł:
- Pairs of edges as chords and as cut-edges
- Autorzy:
- McKee, Terry A.
- Powiązania:
- https://bibliotekanauki.pl/articles/30148711.pdf
- Data publikacji:
- 2014-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
cycle
chord
cut-edge - Opis:
- 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 chords of a common cycle if and only if deleting two vertices never creates two adjacent cut-edges; among 4-connected graphs, every two edges are always chords of a common cycle.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2014, 34, 4; 673-681
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł