On strongly circular-perfectness

DOI10.1016/J.ENDM.2005.06.074MaRDI QIDQ3439367zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 1455118 (Why is no real title available?)
• scientific article; zbMATH DE number 2196279 (Why is no real title available?)
• A note on the star chromatic number
• Circular perfect graphs
• Geometric algorithms and combinatorial optimization
• On certain polytopes associated with graphs
• Star chromatic number
• Sur le coloriage des graphs
• The strong perfect graph theorem
• Three classes of minimal circular-imperfect graphs
• Triangle-free strongly circular-perfect 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)