Cycles and Connectivity in Graphs
From MaRDI portal
Cited in
(53)- On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
- A look at cycles containing specified elements of a graph
- n-connectedness in pure 2-complexes
- Triples in matroid circuits
- A catalogue of small maximal nonhamiltonian graphs
- A nine point theorem for 3-connected graphs
- Cycles through specified vertices of a graph
- Über n-fach zusammenhängende Eckenmengen in Graphen
- Neighborhood conditions for balanced independent sets in bipartite graphs
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- \(D_ \lambda\)-cycles in 3-cyclable graphs
- Flows on flow-admissible signed graphs
- Rooted topological minors on four vertices
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- Long cycles passing through a linear forest
- Cycle traversability for claw-free graphs and polyhedral maps
- Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
- On cycles through specified vertices
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs
- Tough graphs and Hamiltonian circuits. (Reprint)
- Tough graphs and Hamiltonian circuits.
- Circuits and paths through specified nodes
- Some degree bounds for the circumference of graphs
- Cycles passing throughk + 1 vertices ink-connected graphs
- Gabriel andrew dirac
- Neighborhood unions and hamilton cycles
- Anticritical graphs
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- On r-connected graphs with no semi-topological r-wheel
- n-arc connected graphs
- Excluding 4-wheels
- Polytopes, graphs, and complexes
- Edmonds polytopes and weakly hamiltonian graphs
- Graph theory
- Augmenting trees so that every three vertices lie on a cycle
- On a coloring conjecture of Hajós
- Independent paths and \(K_{5}\)-subdivisions
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- Induced minor models. I: Structural properties and algorithmic consequences
- Isometric path complexity of graphs
- Chasing tripods to obtain a rooted subdivision
- Cycles through two edges in signed graphs (extended abstract)
- A new sufficient condition for pancyclability of graphs
- On cycles through prescribed vertices in weakly separable graphs
- The Kelmans-Seymour conjecture. I: Special separations
- The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
- The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
- The Kelmans-Seymour conjecture. IV: A proof
- Cycles through k+2 vertices in k-connected graphs
- An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs
- A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
- On a cycle through a specified linear forest of a graph
- A sufficient condition for pancyclability of graphs
This page was built for publication: Cycles and Connectivity in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5605171)
