Triangle-free strongly circular-perfect graphs (Q1025560): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Convex-round graphs are circular-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / 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: The complexity of determining a shortest cycle of even length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of minimal circular-imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Lehman's theorems to packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of facet producing graphs for vertex packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antiwebs are rank-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular perfect graphs / rank
 
Normal rank

Revision as of 16:11, 1 July 2024

scientific article
Language Label Description Also known as
English
Triangle-free strongly circular-perfect graphs
scientific article

    Statements

    Identifiers