A Berge-keeping operation for graphs (Q2433716): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.12.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148297661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive generation of partitionable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On critical edges in minimal imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connectivity of minimal imperfect graphs / rank
 
Normal rank

Latest revision as of 22:26, 24 June 2024

scientific article
Language Label Description Also known as
English
A Berge-keeping operation for graphs
scientific article

    Statements

    A Berge-keeping operation for graphs (English)
    0 references
    0 references
    30 October 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    coloration
    0 references
    property-keeping operation (minor)
    0 references
    perfect graphs
    0 references
    Berge graphs
    0 references
    odd hole
    0 references
    odd antihole
    0 references
    0 references