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

DOI10.1016/J.DISC.2015.10.021MaRDI QIDQ898138zbMATH OpenOpenAlexFDO

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

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

path partitiondegree conditionOre's theoremdisjoint path coverHamiltonian-connected graph

Mathematics Subject Classification ID

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

Recommendations

• Degree sequence conditions for a graph to be disjoint path coverable
• Disjoint path covers in cubes of connected graphs
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• One-to-one disjoint path covers in digraphs

Cites work

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

Cited in

(12)

• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
• A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Characterization of interval graphs that are unpaired 2-disjoint path coverable
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Disjoint path covers in cubes of connected graphs
• Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
• Disjoint path covers joining prescribed source and sink sets in interval graphs
• Degree sequence conditions for a graph to be disjoint path coverable
• Torus-like graphs and their paired many-to-many disjoint path covers
• One-to-one disjoint path covers in digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898138)