Critical perfect graphs and perfect 3-chromatic graphs (Q1245851): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5668915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on a Problem of Moser / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strong Perfect Graph Conjecture for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring a Family of Circular Arcs / rank
 
Normal rank

Latest revision as of 22:17, 12 June 2024

scientific article
Language Label Description Also known as
English
Critical perfect graphs and perfect 3-chromatic graphs
scientific article

    Statements

    Identifiers