Consecutive colorings of the edges of general graphs
From MaRDI portal
Publication:5959097
DOI10.1016/S0012-365X(00)00437-4zbMath1007.05045WikidataQ128018534 ScholiaQ128018534MaRDI QIDQ5959097
Michał Małafiejski, Marek Kubale, Krzysztof Giaro
Publication date: 30 July 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (28)
Further results on the deficiency of graphs ⋮ Interval cyclic edge-colorings of graphs ⋮ The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class ⋮ Interval edge-colorings of complete graphs ⋮ Lower bounds and a tabu search algorithm for the minimum deficiency problem ⋮ Interval incidence coloring of bipartite graphs ⋮ A comparison of integer and constraint programming models for the deficiency problem ⋮ On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs ⋮ Interval edge-colorings of \(K_{1, m, n}\) ⋮ Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs ⋮ A note on upper bounds for the maximum span in interval edge-colorings of graphs ⋮ On improper interval edge colourings ⋮ Compact cyclic edge-colorings of graphs ⋮ On the structure and deficiency of \(k\)-trees with bounded degree ⋮ Symmetry Breaking Constraints for the Minimum Deficiency Problem ⋮ On resistance of graphs ⋮ Consecutive edge-coloring of the generalized \(\theta \)-graph ⋮ On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic ⋮ Improper interval edge colorings of graphs ⋮ Consecutive colouring of oriented graphs ⋮ Interval incidence coloring of subcubic graphs ⋮ Interval incidence graph coloring ⋮ Interval edge-colorings of complete graphs and \(n\)-dimensional cubes ⋮ Compact scheduling of zero-one time operations in multi-stage systems ⋮ The deficiency of a regular graph ⋮ Cyclic deficiency of graphs ⋮ On the deficiency of bipartite graphs ⋮ Interval edge-coloring: A model of curriculum scheduling
This page was built for publication: Consecutive colorings of the edges of general graphs
