Circuits and paths through specified nodes

DOI10.1016/0095-8956(73)90029-4MaRDI QIDQ2560828zbMATH OpenOpenAlexFDO

Authors G. Thomas Sallee

Publication date 1973

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(73)90029-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx)

Cites work

• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3199420 (Why is no real title available?)
• Cycles and Connectivity in Graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• On the graph structure of convex polyhedra in n-space

Cited in

(3)

• An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs
• Cycle traversability for claw-free graphs and polyhedral maps
• On cycles through prescribed vertices in weakly separable graphs

This page was built for publication: Circuits and paths through specified nodes

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