- Tytuł:
- Edge cycle extendable graphs
- Autorzy:
- McKee, Terry
- Powiązania:
- https://bibliotekanauki.pl/articles/743340.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
cycle extendable graph
chordal graph
chordless graph
minimally 2-connected graph - Opis:
- A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a larger cycle C⁺ is also formed from edges and one chord of a cycle C' of length one greater than C with V(C') ⊆ V(C⁺). Edge cycle extendable graphs are characterized by every block being either chordal (every nontriangular cycle has a chord) or chordless (no nontriangular cycle has a chord); equivalently, every chord of a cycle of length five or more has a noncrossing chord.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 2; 373-378
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł