A note on even pairs (Q5903367): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical properties related to minimal imperfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90063-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974794253 / rank
 
Normal rank

Latest revision as of 10:58, 30 July 2024

scientific article; zbMATH DE number 3991537
Language Label Description Also known as
English
A note on even pairs
scientific article; zbMATH DE number 3991537

    Statements

    A note on even pairs (English)
    0 references
    0 references
    1987
    0 references
    We generalize a theorem of Meyniel about minimal imperfect graphs to partitionable graphs. The general result follows easily from a theorem of Bland, Huang, and Trotter.
    0 references
    0 references
    theorem of Meyniel
    0 references
    minimal imperfect graphs
    0 references
    partitionable graphs
    0 references
    0 references