An 11-vertex theorem for 3-connected cubic graphs.
Robert E. L. AldredSheng BauDerek A. HoltonGordon F. RoylePublished in: J. Graph Theory (1988)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- hamiltonian cycle
- connected components
- connected subgraphs
- graph theoretic
- maximum cardinality
- average degree
- edge weights
- von neumann
- connected graphs
- bipartite graph
- weighted graph
- graph data
- betweenness centrality
- vertex set
- neighborhood graph
- minimum weight
- series parallel
- subgraph isomorphism
- object recognition
- graph kernels
- spanning tree
- graph databases
- graph mining
- b spline