scientific article; zbMATH DE number 930115

zbMATH Open0855.05095MaRDI QIDQ4894069FDOQ4894069

Authors: Lian Yu, Yanpei Liu 

Publication date: 13 November 1996

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

Recommendations

• scientific article; zbMATH DE number 844701
• A note on 3-bisections in subcubic graphs
• A note on the complexity of finding regular subgraphs
• scientific article; zbMATH DE number 1536521
• On D. G. Higman's note on regular 3-graphs
• Note on regular subgraphs
• Three-regular subgraphs of four-regular graphs
• Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
• scientific article; zbMATH DE number 26308
• scientific article; zbMATH DE number 2192091

zbMATH Keywords

NP-completenessplanar graphsatisfiability problemsubgraph problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cited In (4)

• 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
• Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
• Title not available (Why is that?)
• Addendum to: The complexity of regular subgraph recognition

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 Q4894069)