On an interval (1, 1)-coloring of incidentors of interval colorable graphs
From MaRDI portal
Publication:3186825
DOI10.1134/S199047891502012XzbMath1349.05123MaRDI QIDQ3186825
Publication date: 12 August 2016
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- One more polynomial complete consecutive retrieval problem
- Investigation on interval edge-colorings of graphs
- Interval colorings of edges of a multigraph
- Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On an interval (1, 1)-coloring of incidentors of interval colorable graphs