Circuits and paths through specified nodes

DOI10.1016/0095-8956(73)90029-4zbMath0262.05105OpenAlexW2022278604MaRDI QIDQ2560828

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)

Related Items (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

Cites Work

• On the graph structure of convex polyhedra in \(n\)-space
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Cycles and Connectivity in Graphs
• Unnamed Item
• Unnamed Item

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