Hadwiger's Conjecture for Proper Circular Arc Graphs
组合数学
2007-05-23 v2
摘要
Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc representation where no arc is completely contained in any other arc. Hadwiger's conjecture states that if a graph has chromatic number , then a complete graph of vertices is a minor of . We prove Hadwiger's conjecture for proper circular arc graphs.
引用
@article{arxiv.math/0605503,
title = {Hadwiger's Conjecture for Proper Circular Arc Graphs},
author = {Naveen Belkale and L. Sunil Chandran},
journal= {arXiv preprint arXiv:math/0605503},
year = {2007}
}
备注
18 pages, 2 figures