A note on chromatic number of (cap, even hole)-free graphs (Q1712540): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bisimplicial vertices in even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and algorithms for (cap, even hole)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even and odd holes in cap-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs of graphs with large chromatic number. I. Odd holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs: A survey / rank
 
Normal rank

Revision as of 22:38, 17 July 2024

scientific article
Language Label Description Also known as
English
A note on chromatic number of (cap, even hole)-free graphs
scientific article

    Statements

    Identifiers