Discs in unbreakable graphs (Q1900520): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 13:56, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Discs in unbreakable graphs |
scientific article |
Statements
Discs in unbreakable graphs (English)
0 references
11 March 1996
0 references
A graph \(G\) is said to be unbreakable if it has at least three vertices and neither the graph nor its complement has a star cutset (i.e., a non- empty subset \(C\) of the vertices of \(G\), for which \(G- C\) is disconnected and some vertex of \(C\) is adjacent to all other vertices of \(C\)). In this paper it is shown that every vertex in an unbreakable graph is in a disc, where a disc is a chordless cycle, or the complement of a chordless cycle, with at least five vertices. A corollary is that every vertex in a minimal imperfect graph is in a disc.
0 references
perfect graph
0 references
unbreakable graph
0 references
disc
0 references
chordless cycle
0 references