INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES

DOI10.46991/PYSU:A/2021.55.2.113zbMath1493.05114MaRDI QIDQ5100181

R. R. Kamalian, A. Kh. Sahakyan

Publication date: 29 August 2022

Published in: Proceedings of the YSU A: Physical and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/uzeru838

zbMATH Keywords

dynamic programmingtreesbipartite matchinginterval edge-coloringinterval \(t\)-coloringrestrictions on edges

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES

Cites Work

• Interval edge-colorings of complete graphs
• 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
• Generalized 1-factorization of trees
• Interval edge-colorings of Cartesian products of graphs I
• On the Complexity of Timetable and Multicommodity Flow Problems
• Interval colorings of edges of a multigraph
• Reducibility among Combinatorial Problems
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES