Every circle graph of girth at least 5 is 3-colourable.
Alexander A. AgeevPublished in: Discret. Math. (1999)
Keyphrases
- graph theory
- graph representation
- graph model
- random walk
- graph structure
- structured data
- connected components
- bipartite graph
- directed graph
- real time
- graph theoretic
- weighted graph
- graph matching
- graph cuts
- xml documents
- pairwise
- image segmentation
- link analysis
- directed acyclic graph
- information retrieval
- graph partitioning
- data sets
- database
- random graphs
- graph construction
- graph search
- stable set