Upper bounds on the number of colors in interval edge-colorings of graphs
From MaRDI portal
Publication:6635096
DOI10.1016/J.DISC.2024.114229MaRDI QIDQ6635096
Arsen Hambardzumyan, Levon Muradyan
Publication date: 9 November 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Could not fetch data.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Investigation on interval edge-colorings of graphs
- Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
- Interval edge-colorings of Cartesian products of graphs I
- On cyclically-interval edge colorings of trees
- Interval colorings of edges of a multigraph
- Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs
- Consecutive colorings of the edges of general graphs
This page was built for publication: Upper bounds on the number of colors in interval edge-colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635096)
