The NP-completeness of (1,r)-subcolorability of cubic graphs
From MaRDI portal
Publication:1603517
DOI10.1016/S0020-0190(01)00205-8zbMath1032.68122MaRDI QIDQ1603517
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Monopolar graphs: complexity of computing classical graph parameters ⋮ Complexity and algorithms for recognizing polar and monopolar graphs ⋮ Stable-\(\Pi\) partitions of graphs ⋮ The complexity of some acyclic improper colourings
Cites Work
This page was built for publication: The NP-completeness of (1,r)-subcolorability of cubic graphs