Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey

DOI10.1016/0012-365X(90)90130-AzbMath0726.05043MaRDI QIDQ2277468

Oscar Ordaz, Bill Jackson

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

surveyindependence numberconnectivityhamiltonian

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (24)

Pancyclic BIBD block-intersection graphs ⋮ A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs ⋮ A note on pancyclism of highly connected graphs ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ Hamiltonian properties and the bipartite independence number ⋮ A short proof of the Chen-Manalastas theorem ⋮ The Chvátal-Erdös condition for cycles in triangle-free graphs ⋮ Hamilton-connected, vertex-pancyclic and bipartite holes ⋮ Cycles of many lengths in Hamiltonian graphs ⋮ Hamiltonicity, independence number, and pancyclicity ⋮ A survey on Hamilton cycles in directed graphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Antidirected Hamiltonian paths and cycles of digraphs with \(\alpha_2\)-stable number 2 ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Star subdivisions and connected even factors in the square of a graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach ⋮ On the Thomassen's conjecture ⋮ An extension of the Win theorem: counting the number of maximum independent sets ⋮ Pancyclicity of Hamiltonian and highly connected graphs ⋮ The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index ⋮ A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition ⋮ Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section ⋮ An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs
• Existence of Dlambda-cycles and Dlambda-paths
• On a conjecture of Bondy
• A Chvátal-Erdős condition for (1,1)-factors in digraphs
• A Chvátal-Erdős condition for Hamilton cycles in digraphs
• The Chvátal-Erdős condition and pancyclic line-graphs
• A remark on Hamiltonian cycles
• Circuits through specified edges
• An Ore-type condition implying a digraph to be pancyclic
• Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
• Every finite strongly connected digraph of stability 2 has a Hamiltonian path
• A note on Hamiltonian circuits
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Structure Des Graphes De Connexite k ≥ 2 Et De Stabilite α = k + 2
• A new sufficient condition for hamiltonian graphs
• Long Cycles in Digraphs
• Diconnected Orientations and a Conjecture of Las Vergnas
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• The Theory of Round Robin Tournaments

This page was built for publication: Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey