ISSN:
1435-5914
Keywords:
perfect
;
minimal imperfect
;
Berge
;
star cutset
;
unbreakable
;
disc
;
weakly chordal
;
weakly triangulated
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We show 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01793011
Permalink