Perfectness of clustered graphs

DOI10.1016/J.DISOPT.2013.07.006MaRDI QIDQ1799385zbMATH OpenOpenAlexFDO

Authors Denis Cornaz, Tınaz Ekim, Bernard Ries, Flavia Bonomo

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)

Recommendations

• On the complexity of the selective graph coloring problem in some special classes of graphs
• Selective graph coloring in some special classes of graphs
• On the minimum and maximum selective graph coloring problems in some graph classes
• On some applications of the selective graph coloring problem
• Matrix partitions of perfect graphs

Cites work

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

Cited in

(6)

• On the minimum and maximum selective graph coloring problems in some graph classes
• Clustering and domination in perfect graphs
• An exact algorithm for the partition coloring problem
• On some applications of the selective graph coloring problem
• A note on selective line-graphs and partition colorings
• Cluster expansion formulas and perfect matchings

This page was built for publication: Perfectness of clustered graphs

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