-2k -1)-Choosability of n-Vertex Graphs.
Wongsakorn CharoenpanitseriPublished in: Int. J. Math. Math. Sci. (2015)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- hamiltonian cycle
- attributed graphs
- maximum cardinality
- connected subgraphs
- graph matching
- edge weights
- neural network
- structured objects
- traveling salesman problem
- graph representation
- graph theory
- average degree
- graph databases
- graph model
- series parallel
- similarity function
- connected components
- random walk
- pairwise
- real time