- Tytuł:
- Strongly Unichord-Free Graphs
- Autorzy:
- McKee, Terry A.
- Powiązania:
- https://bibliotekanauki.pl/articles/31343449.pdf
- Data publikacji:
- 2019-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
unichord-free graph
strongly chordal graph - Opis:
- Several recent papers have investigated unichord-free graphs—the graphs in which no cycle has a unique chord. This paper proposes a concept of strongly unichord-free graph, defined by being unichord-free with no cycle of length 5 or more having exactly two chords. In spite of its overly simplistic look, this can be regarded as a natural strengthening of unichordfree graphs—not just the next step in a sequence of strengthenings—and it has a variety of characterizations. For instance, a 2-connected graph is strongly unichord-free if and only if it is complete bipartite or complete or “minimally 2-connected” (defined as being 2-connected such that deleting arbitrary edges always leaves non-2-connected subgraphs).
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 2; 365-374
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł