On the hardness of computing span of subcubic graphs

DOI10.1016/J.IPL.2015.08.009MaRDI QIDQ888955zbMATH OpenOpenAlexFDO

Authors R. Janczewski, Krzysztof Turowski

Publication date 5 November 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2015.08.009

zbMATH Keywords

computational complexityspanvertex coloringsubcubic graphs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

Recommendations

• An O(n n) algorithm for finding edge span of cacti
• Bounds and complexity results for strong edge colouring of subcubic graphs
• Approximation of 3-Edge-Coloring of Cubic Graphs
• Interval incidence coloring of subcubic graphs
• The NP-completeness of (1,r)-subcolorability of cubic graphs

Cites work

• Combinatorial Geometry and Graph Theory
• The complexity of satisfiability problems
• The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
• Three short proofs in graph theory

Cited in

(2)

• scientific article; zbMATH DE number 1629828 (Why is no real title available?)
• An O(n n) algorithm for finding edge span of cacti

This page was built for publication: On the hardness of computing span of subcubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888955)