Degree sequence conditions for a graph to be disjoint path coverable
From MaRDI portal
Publication:2696615
DOI10.1016/j.dam.2023.02.002OpenAlexW4319878837MaRDI QIDQ2696615
Publication date: 17 April 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.02.002
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Cites Work
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
- The spanning connectivity of line graphs
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- Hamilton connected graphs
- The super laceability of the hypercubes
- Ore-type degree conditions for disjoint path covers in simple graphs
- On the spanning fan-connectivity of graphs
- A method in graph theory
- On strong Menger-connectivity of star graphs
- On the spanning connectivity of tournaments
- Sufficient conditions for graphs to be spanning connected
- Super spanning connectivity of split-star networks
- On spanning connected graphs
- On Hamiltonian bipartite graphs
- Polynomially determining spanning connectivity of locally connected line graphs
- Note on Hamilton Circuits
- A group-theoretic model for symmetric interconnection networks
- On Path Cover Problems in Digraphs and Applications to Program Testing
- Biclosure and bistability in a balanced bipartite graph
- A sufficient condition for n ‐connectedness of graphs
- A sufficient condition for hamiltonian connectedness
- Some Theorems on Abstract Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Degree sequence conditions for a graph to be disjoint path coverable
