Connectivity of \(k\)-extendable graphs with large \(k\).

DOI10.1016/S0166-218X(03)00198-7zbMath1036.05041MaRDI QIDQ1421484

Dingjun Lou, Qinglin Yu

Publication date: 26 January 2004

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

zbMATH Keywords

Hamiltonian graphMinimum degree\(k\)-Extendable graphMaximal \(k\)-extendable graphMinimal \(k\)-extendable graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs ⋮ Hamiltonian and long paths in bipartite graphs with connectivity ⋮ Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity ⋮ Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ Matching extension and distance spectral radius ⋮ Minimum degree of minimal \((n-10)\)-factor-critical graphs ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ Hamiltonian and long cycles in bipartite graphs with connectivity ⋮ M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs

Cites Work

• On n-extendable graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Matching extension and minimum degree
• A note onn-extendable graphs
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connectivity of \(k\)-extendable graphs with large \(k\).