Degree sequence conditions for a graph to be disjoint path coverable.
Eminjan SabirJixiang MengPublished in: Discret. Appl. Math. (2023)
Keyphrases
- solution path
- random graphs
- graph representation
- random walk
- hamiltonian path
- graph theory
- sufficient conditions
- shortest path
- directed graph
- weighted graph
- shortest path problem
- graph theoretic
- graph model
- graph search
- graph structure
- strongly connected
- pairwise
- stable set
- graph construction
- graph structures
- clustering coefficient
- degree distribution
- directed acyclic graph
- path length
- edge weights
- data sets
- endpoints
- bipartite graph
- graph matching
- connected components
- path planning
- bayesian networks
- social networks