scientific article; zbMATH DE number 1475184

zbMATH Open0948.05048MaRDI QIDQ4489799FDOQ4489799

Authors: Kefeng Diao, Ping Zhao, Huishan Zhou 

Publication date: 28 November 2000

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 5941286
• The complexity of \(P_{4}\)-decomposition of regular graphs and multigraphs
• Splitter theorems for 4-regular graphs
• 4‐Separations in Hajós graphs
• P4-decompositions of regular graphs
• On \(P_4\)-decomposition of graphs
• Nonseparating K₄‐subdivisions in graphs of minimum degree at least 4
• Compatible circuit decompositions of 4‐regular graphs
• On 4-connected 4-regular graphs without even cycle decompositions
• Complexity and algorithms for the connected vertex cover problem in 4-regular graphs

zbMATH Keywords

NP-completegraph separation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (1)

• Degree-constrained 2-partitions of graphs

This page was built for publication:

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