Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three.
Luyi LiFei HuangJinjiang YuanPublished in: Discret. Math. (2022)
Keyphrases
- undirected graph
- disjoint paths
- edge weights
- directed graph
- weighted graph
- vertex set
- shortest path
- minimum weight
- attributed graphs
- spanning tree
- graph matching
- approximation algorithms
- directed acyclic graph
- minimum length
- strongly connected
- connected components
- multiscale
- labeled graphs
- graph structure
- path length
- bipartite graph
- lowest cost
- edge information
- minimum cost
- complex networks
- hamiltonian cycle
- random graphs
- maximum cardinality
- average degree
- maximum number
- graph theory