284 search results - page 6 / 57 » On the adaptable chromatic number of graphs |
APAL
1998
13 years 7 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
COMBINATORICS
2007
13 years 7 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
JGT
2010
13 years 5 months ago
2010
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class ...
DM
1998
13 years 7 months ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
DAM
2008
13 years 7 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...