Almost every complement of a tadpole graph is not chromatically unique.
Jianfeng WangQiongxiang HuangKok Lay TeoFrancesco BelardoRuying LiuChengfu YePublished in: Ars Comb. (2013)
Keyphrases
- structured data
- random walk
- graph structure
- graph representation
- directed graph
- graph theory
- graph model
- graph partitioning
- graph databases
- graph theoretic
- graph mining
- directed acyclic graph
- bipartite graph
- weighted graph
- connected components
- dependency graph
- random graphs
- graph search
- stable set
- adjacency matrix
- graph grammars
- neural network
- equivalence classes
- small world
- graph matching
- decision trees
- social networks
- learning algorithm