On paths and cycles through specified vertices

DOI10.1016/J.DISC.2003.11.059MaRDI QIDQ1883258zbMATH OpenOpenAlexFDO

Authors Jochen Harant

Publication date 1 October 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2003.11.059

zbMATH Keywords

ConnectivityCyclePathSpecified vertices

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• 4‐chrome Graphen und vollständige 4‐Graphen
• A nine point theorem for 3-connected graphs
• A note on Hamiltonian circuits
• Cycles through specified vertices
• Cycles through subsets with large degree sums
• Long paths and cycles through specified vertices in \(k\)-connected graphs.
• Menger's theorem
• When m vertices in a k-connected graph cannot be walked round along a simple cycle

Cited in

(12)

• Broadcasts on paths and cycles
• A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
• Cycles through given vertices and closures
• On a cycle through a specified linear forest of a graph
• On short paths through prescribed vertices of a graph
• scientific article; zbMATH DE number 2081148 (Why is no real title available?)
• A degree condition for cycles passing through specified vertices and edges
• A look at cycles containing specified elements of a graph
• Relative length of longest paths and longest cycles in triangle-free graphs
• Local topological toughness and local factors
• On cycles through specified vertices
• Local properties and upper embeddability of connected multigraphs

This page was built for publication: On paths and cycles through specified vertices

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