Bad list assignments for non-k $k$-choosable k $k$-chromatic graphs with 2k+2 $2k+2$-vertices.
Jialu ZhuXuding ZhuPublished in: J. Graph Theory (2023)
Keyphrases
- weighted graph
- labeled graphs
- random graphs
- adjacency matrix
- undirected graph
- attributed graphs
- average degree
- graph theory
- graph matching
- hamiltonian cycle
- planar graphs
- graph theoretic
- edge weights
- connected subgraphs
- color images
- maximal cliques
- maximum cardinality
- phase transition
- graph construction
- graph representation
- color information
- directed graph
- random walk
- graph search
- graph clustering
- graph structure
- similarity function
- data structure
- directed edges