On paths and cycles through specified vertices
From MaRDI portal
Publication:1883258
DOI10.1016/J.DISC.2003.11.059zbMATH Open1048.05050OpenAlexW2002648124MaRDI QIDQ1883258FDOQ1883258
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
Cites Work
- Title not available (Why is that?)
- A note on Hamiltonian circuits
- Cycles through specified vertices
- A nine point theorem for 3-connected graphs
- Cycles through subsets with large degree sums
- Long paths and cycles through specified vertices in \(k\)-connected graphs.
- When m vertices in a k-connected graph cannot be walked round along a simple cycle
- 4‐chrome Graphen und vollständige 4‐Graphen
- Menger's theorem
Cited In (12)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs
- Cycles through given vertices and closures
- Title not available (Why is that?)
- On a cycle through a specified linear forest of a graph
- On short paths through prescribed vertices of a graph
- 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
- Broadcasts on paths and cycles
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)
