The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs.
Grant FickesWing Hong Tony WongPublished in: Electron. J. Graph Theory Appl. (2022)
Keyphrases
- undirected graph
- small number
- graph theory
- minimum spanning trees
- color images
- graph matching
- weighted graph
- learning algorithm
- random graphs
- graph theoretic
- human perception
- adjacency graph
- series parallel
- subgraph isomorphism
- minimum cost
- graph mining
- memory requirements
- shortest path
- computational complexity
- social networks