Hadwiger’s conjecture for proper circular arc graphs
Authors:
- Naveen BelkaleNBNaveen Belkale
- L. Sunil ChandranLCL. Sunil Chandran
- 1 May 2009
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 30 (4) , 946-956
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Hadwiger’s conjecture for line graphsEuropean Journal of Combinatorics, 2004
- Hadwiger's conjecture forK 6-free graphsCombinatorica, 1993
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURESBritish Journal of Mathematical and Statistical Psychology, 1974
- Algorithms on circular‐arc graphsNetworks, 1974
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971
- What Are the Intersection Graphs of Arcs in a Circle?The American Mathematical Monthly, 1969
- Scheduling of traffic lights—A new approachTransportation Research, 1968
- Circular genetic mapsJournal of Cellular Physiology, 1967
- On the structure of 5- and 6-chromatic abstract graphs.Journal für die reine und angewandte Mathematik (Crelles Journal), 1964
- A Property of 4-Chromatic Graphs and some Remarks on Critical GraphsJournal of the London Mathematical Society, 1952