INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES
From MaRDI portal
Publication:5883705
DOI10.46991/PYSU:A/2021.55.3.160MaRDI QIDQ5883705FDOQ5883705
Authors: A. Kh. Sahakyan, R. R. Kamalian
Publication date: 22 March 2023
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/uzeru925
Recommendations
dynamic programmingtreeslist coloringcactus graphspseudo-polynomial algorithminterval vertex-coloring
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- On the Complexity of Timetable and Multicommodity Flow Problems
- Interval vertex-coloring of a graph with forbidden colors
- Interval edge-colorings of trees with restrictions on the edges
- Interval edge coloring of a graph with forbidden colors
Cited In (3)
This page was built for publication: INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883705)