2-divisibility of some odd hole free graphs (Q2155661): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in odd-hole-free graphs without dart or without bull / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_{4}\)-free graphs with no odd holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect divisibility and 2‐divisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of (banner, odd hole)‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the divisibility of graphs / 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: A survey of χ‐boundedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems on induced subgraphs / rank
 
Normal rank

Latest revision as of 15:56, 29 July 2024

scientific article
Language Label Description Also known as
English
2-divisibility of some odd hole free graphs
scientific article

    Statements