Ore-type degree conditions for disjoint path covers in simple graphs

DOI10.1016/j.disc.2015.10.021zbMath1327.05276OpenAlexW2162674041MaRDI QIDQ898138

Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim

Publication date: 8 December 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.021

zbMATH Keywords

Hamiltonian-connected graphpath partitiondegree conditionOre's theoremdisjoint path cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (9)

Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Characterization of interval graphs that are unpaired 2-disjoint path coverable ⋮ A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs ⋮ Disjoint path covers joining prescribed source and sink sets in interval graphs ⋮ Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ One-to-one disjoint path covers in digraphs ⋮ Degree sequence conditions for a graph to be disjoint path coverable ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Torus-like graphs and their paired many-to-many disjoint path covers

Cites Work

• Unnamed Item
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• Hamilton connected graphs
• The two-equal-disjoint path cover problem of matching composition network
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Single-source three-disjoint path covers in cubes of connected graphs
• Paired many-to-many disjoint path covers of the hypercubes
• Disjoint path covers in cubes of connected graphs
• On spanning connected graphs
• Note on Hamilton Circuits
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• On Path Cover Problems in Digraphs and Applications to Program Testing
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
• Some Theorems on Abstract Graphs

This page was built for publication: Ore-type degree conditions for disjoint path covers in simple graphs