Discontinuities in the complexities of some graph recognition problems

zbMATH Open1278.05190MaRDI QIDQ2848780FDOQ2848780

Augustine Moshi

Publication date: 26 September 2013

Published in: South Pacific Journal of Pure and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

matching cutset

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• Representing graphs by disks and balls (a survey of recognition-complexity results)
• Об одной задаче распознавания предфрактального графа
• Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
• Recognizing tough graphs is NP-hard
• Graph approach to solving problems of combinatorial recognition

This page was built for publication: Discontinuities in the complexities of some graph recognition problems

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