Interval edge-colorings of \(K_{1, m, n}\)
From MaRDI portal
Publication:400539
DOI10.1016/j.dam.2014.04.003zbMath1298.05118arXiv1308.4431OpenAlexW2747222890MaRDI QIDQ400539
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.4431
Related Items
Further results on the deficiency of graphs, ON INTERVAL EDGE-COLORINGS OF COMPLETE MULTIPARTITE GRAPHS, Interval cyclic edge-colorings of graphs, Some remarks on interval colorings of complete tripartite and biregular graphs, New algorithm for calculating chromatic index of graphs and its applications, Interval edge-coloring: A model of curriculum scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on upper bounds for the maximum span in interval edge-colorings of graphs
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
- On the deficiency of bipartite graphs
- Investigation on interval edge-colorings of graphs
- Consecutive edge-coloring of the generalized \(\theta \)-graph
- Interval edge-colorings of Cartesian products of graphs I
- On one-sided interval edge colorings of biregular bipartite graphs
- Interval colorings of edges of a multigraph
- Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs
- Consecutive colorings of the edges of general graphs