scientific article; zbMATH DE number 1409249
From MaRDI portal
Publication:4940090
Recommendations
- On interval -coloring of bipartite graphs
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
- Bipartite Edge Coloring in O(\Delta m) Time
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs
- Hard coloring problems in low degree planar bipartite graphs
- On the Hardness of 4-Coloring a 3-Colorable Graph
- Total colouring regular bipartite graphs is NP-hard
- P₄-free colorings and P₄-bipartite graphs
- scientific article; zbMATH DE number 888854
Cited in
(29)- Greedy \(T\)-colorings of graphs
- On the deficiency of bipartite graphs
- Chromatic scheduling in a cyclic open shop
- Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice
- Some remarks on interval colorings of complete tripartite and biregular graphs
- On interval -coloring of bipartite graphs
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs
- The deficiency of a regular graph
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
- On interval edge colorings of biregular bipartite graphs with small vertex degrees
- On improper interval edge colourings.
- Symmetry breaking constraints for the minimum deficiency problem
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
- A comparison of integer and constraint programming models for the deficiency problem
- Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs
- Consecutive colorings of graphs
- scientific article; zbMATH DE number 7310080 (Why is no real title available?)
- Forbidden structures for planar perfect consecutively colourable graphs
- Interval non-edge-colorable bipartite graphs and multigraphs
- NP-hardness of compact scheduling in simplified open and flow shops.
- Fixed-parameter complexity of \(\lambda\)-labelings
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic
- Some bounds on the number of colors in interval edge-colorings of graphs
- Compact scheduling of zero-one time operations in multi-stage systems
- Delay colouring in quartic graphs
- Lower bounds and a tabu search algorithm for the minimum deficiency problem
- On interval edge colorings of ( , )-biregular bipartite graphs
- On the structure and deficiency of k-trees with bounded degree
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940090)