Dense Eulerian Graphs are $(1, 3)$-Choosable.
Huajing LuXuding ZhuPublished in: Electron. J. Comb. (2022)
Keyphrases
- series parallel
- subgraph isomorphism
- graph theory
- graph theoretic
- graph representation
- bipartite graph
- graph model
- densely connected
- graph construction
- graph kernels
- complex structures
- undirected graph
- level set method
- database
- graph mining
- graph structure
- graph matching
- directed graph
- optical flow
- image processing
- data sets