scientific article; zbMATH DE number 4189769

MaRDI QIDQ5753981zbMATH OpenFDO

Authors

Publication date 1990

zbMATH Keywords

balloon graphfactorable graphk-traversable graphNP-completenesssegments

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 4099351
• scientific article; zbMATH DE number 992948
• scientific article; zbMATH DE number 3972890
• scientific article; zbMATH DE number 68918
• scientific article; zbMATH DE number 4025480
• A generalization of Kneser graphs
• \(k\)-planar graphs
• Cycles and paths through specified vertices in k-connected graphs
• scientific article; zbMATH DE number 3849268
• Traceability of k-traceable oriented graphs

Cited in

(4)

• \(k\)-trails: recognition, complexity, and approximations
• The computational complexity of the parallel knock-out problem
• \(k\)-trails: recognition, complexity, and approximations
• TRAVERSING A GRAPH IN GENERAL POSITION

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