Perfectness of clustered graphs

DOI10.1016/j.disopt.2013.07.006zbMath1506.05061OpenAlexW2121607147MaRDI QIDQ1799385

Tınaz Ekim, Denis Cornaz, Bernard Ries, Flavia Bonomo-Braberman

Publication date: 18 October 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2013.07.006

zbMATH Keywords

threshold graphperfect matrixselective coloringconformal matrixpartition coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On the minimum and maximum selective graph coloring problems in some graph classes ⋮ On some applications of the selective graph coloring problem ⋮ An exact algorithm for the partition coloring problem ⋮ A note on selective line-graphs and partition colorings

Cites Work

• Routing and wavelength assignment by partition colouring
• On certain polytopes associated with graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Threshold graphs and related topics
• A branch-and-price approach for the partition coloring problem
• Recognizing Berge graphs
• Normal hypergraphs and the perfect graph conjecture
• On some applications of the selective graph coloring problem
• Combinatorial Optimization
• Selective Graph Coloring in Some Special Classes of Graphs

This page was built for publication: Perfectness of clustered graphs