Vertex signatures and edge-4-colorings of 4-regular plane graphs.
François JaegerGerhard KoesterPublished in: J. Graph Theory (1990)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- vertex set
- directed graph
- spanning tree
- minimum weight
- graph structure
- attributed graphs
- directed acyclic graph
- approximation algorithms
- hamiltonian cycle
- labeled graphs
- graph coloring
- edge segments
- edge detection
- complex networks
- maximum cardinality
- strongly connected
- three dimensional
- edge information
- graph model
- graph theory
- graph theoretic
- minimum cost
- graph matching
- shortest path
- minimum spanning trees
- random walk
- connected subgraphs
- combinatorial problems
- graph clustering
- graph mining
- average degree
- search space