On strongly circular-perfectness

DOI10.1016/J.ENDM.2005.06.074zbMATH Open1200.05077OpenAlexW2069152202MaRDI QIDQ3439367FDOQ3439367

Authors: Sylvain Coulonges, Arnaud Pêcher, Annegret K. Wagler 

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.074

zbMATH Keywords

graphcircular coloringcircular-perfect

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Cites Work

• Geometric algorithms and combinatorial optimization
• Sur le coloriage des graphs
• On certain polytopes associated with graphs
• The strong perfect graph theorem
• Title not available (Why is that?)
• Circular perfect graphs
• Star chromatic number
• Triangle-free strongly circular-perfect graphs
• A note on the star chromatic number
• Title not available (Why is that?)
• Three classes of minimal circular-imperfect graphs

Cited In (1)

• Claw-free circular-perfect graphs

This page was built for publication: On strongly circular-perfectness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439367)