Interval edge-colorings of K₁, m, n
From MaRDI portal
Publication:400539
Abstract: In this note we prove that K_{1,m,n} is interval edge-colorable if and only if gcd(m+1,n+1)=1. It settles in the affirmative a conjecture of Petrosyan.
Recommendations
Cites work
- A note on upper bounds for the maximum span in interval edge-colorings of graphs
- Consecutive colorings of the edges of general graphs
- Consecutive edge-coloring of the generalized -graph
- scientific article; zbMATH DE number 165470 (Why is no real title available?)
- scientific article; zbMATH DE number 1161387 (Why is no real title available?)
- scientific article; zbMATH DE number 1990715 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Interval colorings of edges of a multigraph
- Interval edge-colorings of Cartesian products of graphs I
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
- Interval non-edge-colorable bipartite graphs and multigraphs
- Investigation on interval edge-colorings of graphs
- On one-sided interval edge colorings of biregular bipartite graphs
- On the deficiency of bipartite graphs
Cited in
(9)- Some remarks on interval colorings of complete tripartite and biregular graphs
- New algorithm for calculating chromatic index of graphs and its applications
- Further results on the deficiency of graphs
- Interval cyclic edge-colorings of graphs
- Interval edge-colorings of complete graphs
- On an interval (1, 1)-coloring of incidentors of interval colorable graphs
- Interval edge-coloring: A model of curriculum scheduling
- Interval edge-colorings of composition of graphs
- ON INTERVAL EDGE-COLORINGS OF COMPLETE MULTIPARTITE GRAPHS
This page was built for publication: Interval edge-colorings of \(K_{1, m, n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400539)
