A note on selective line-graphs and partition colorings
From MaRDI portal
Publication:2294381
DOI10.1016/j.orl.2019.08.005zbMath1476.05165OpenAlexW2972847949MaRDI QIDQ2294381
Fabio Furini, Enrico Malaguti, Denis Cornaz, Alberto Santini
Publication date: 10 February 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/20206
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)
Uses Software
Cites Work
- On the minimum and maximum selective graph coloring problems in some graph classes
- Solving vertex coloring problems as maximum weight stable set problems
- Facet-inducing web and antiweb inequalities for the graph coloring polytope
- Routing and wavelength assignment by partition colouring
- Weighted sum coloring in batch scheduling of conflicting jobs
- An exact algorithm for the partition coloring problem
- Perfectness of clustered graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Maximum-weight stable sets and safe lower bounds for graph coloring
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- A branch-and-price approach for the partition coloring problem
- A note on the Cornaz-Jost transformation to solve the graph coloring problem
- Chromatic Gallai identities operating on Lovász number
- On the complexity of the selective graph coloring problem in some special classes of graphs
- A one-to-one correspondence between colorings and stable sets
- On some applications of the selective graph coloring problem
- On the recursive largest first algorithm for graph colouring
This page was built for publication: A note on selective line-graphs and partition colorings
