1302 search results - page 29 / 261 » On the Strong Chromatic Number |
216
click to vote
DAM
2011
15 years 1 months ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
161
click to vote
IPL
2007
15 years 5 months ago
2007
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
160
click to vote
EJC
2008
15 years 6 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
175
click to vote
PODC
2006
ACM
16 years 4 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
156
click to vote
CPC
2007
15 years 6 months ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...