Cycles and Connectivity in Graphs

DOI10.4153/CJM-1967-121-2zbMath0205.28501OpenAlexW2313955381WikidataQ96162082 ScholiaQ96162082MaRDI QIDQ5605171

Mark E. Watkins, Dale M. Mesner

Publication date: 1967

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1967-121-2

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (50)

n-connectedness in pure 2-complexes ⋮ Triples in matroid circuits ⋮ Circuits through prescribed vertices in k‐connected k‐regular graphs ⋮ $n$-Arc connected graphs ⋮ Neighborhood unions and hamilton cycles ⋮ An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs ⋮ \(D_ \lambda\)-cycles in 3-cyclable graphs ⋮ Polytopes, graphs, and complexes ⋮ 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 ⋮ The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs ⋮ Independent paths and \(K_{5}\)-subdivisions ⋮ Long cycles passing through a linear forest ⋮ Neighborhood conditions for balanced independent sets in bipartite graphs ⋮ (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels ⋮ Cycles passing throughk + 1 vertices ink-connected graphs ⋮ A catalogue of small maximal nonhamiltonian graphs ⋮ A nine point theorem for 3-connected graphs ⋮ Edmonds polytopes and weakly hamiltonian graphs ⋮ Cycles through specified vertices of a graph ⋮ Cycle traversability for claw-free graphs and polyhedral maps ⋮ Cycles through a prescribed vertex set in \(n\)-connected graphs. ⋮ Anticritical graphs ⋮ On r‐Connected Graphs with No Semi‐topological r‐Wheel ⋮ Excluding 4‐Wheels ⋮ Über n-fach zusammenhängende Eckenmengen in Graphen ⋮ On cycles through specified vertices ⋮ Reducing Hajós' 4-coloring conjecture to 4-connected graphs ⋮ Tough graphs and Hamiltonian circuits. (Reprint) ⋮ Augmenting trees so that every three vertices lie on a cycle ⋮ Graph theory ⋮ Flows on flow-admissible signed graphs ⋮ A sufficient condition for pancyclability of graphs ⋮ On a coloring conjecture of Hajós ⋮ The Parameterized Complexity of Graph Cyclability ⋮ A new sufficient condition for pancyclability of graphs ⋮ On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs ⋮ On cycles through prescribed vertices in weakly separable graphs ⋮ Tough graphs and Hamiltonian circuits. ⋮ Circuits and paths through specified nodes ⋮ 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 ⋮ A look at cycles containing specified elements of a graph ⋮ Some degree bounds for the circumference of graphs ⋮ Cycles through \(k+2\) vertices in \(k\)-connected graphs ⋮ Rooted topological minors on four vertices ⋮ Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\) ⋮ Gabriel andrew dirac

This page was built for publication: Cycles and Connectivity in Graphs