Selective Graph Coloring in Some Special Classes of Graphs

DOI10.1007/978-3-642-32147-4_29zbMath1370.05167OpenAlexW1843948653MaRDI QIDQ3167636

Marc Demange, Bernard Ries, Petrică C. Pop, Jérôme Monnot

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_29

zbMATH Keywords

computational complexityschedulingbipartite graphssplit graphscomplete \(q\)-partite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On some applications of the selective graph coloring problem ⋮ Perfectness of clustered graphs ⋮ An improved hybrid ant-local search algorithm for the partition graph coloring problem

This page was built for publication: Selective Graph Coloring in Some Special Classes of Graphs