Temat: cycle extendable graph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Skocz do pozycji: 2.

Tytuł:: Strongly pancyclic and dual-pancyclic graphs
Autorzy:: McKee, Terry
Powiązania:: https://bibliotekanauki.pl/articles/743097.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: pancyclic graph
cycle extendable
chordal graph
pancyclic matroid
dual-chordal graph
Opis:: Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C¯ and every nonspanning cycle C is almost contained in another cycle C⁺. This is equivalent to requiring, in addition, that the sizes of C¯ and C⁺ differ by one from the size of C. Strongly pancyclic graphs are pancyclic and chordal, and their cycles enjoy certain interpolation and extrapolation properties with respect to almost containment. Much of this carries over from graphic to cographic matroids; the resulting 'dual-pancyclic' graphs are shown to be exactly the 3-regular dual-chordal graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2009, 29, 1; 5-14
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja