Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
COMBINATORICS
2006
97views more  COMBINATORICS 2006»
10 years 1 months ago
H-Free Graphs of Large Minimum Degree
We prove the following extension of an old result of Andr
Noga Alon, Benny Sudakov
EJC
2008
10 years 1 months ago
On the adaptable chromatic number of graphs
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...
Pavol Hell, Xuding Zhu
EJC
2008
10 years 1 months ago
Fractional coloring and the odd Hadwiger's conjecture
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...
Ken-ichi Kawarabayashi, Bruce A. Reed
DM
2008
112views more  DM 2008»
10 years 1 months ago
Coloring the Cartesian sum of graphs
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...
Daphne Der-Fen Liu, Xuding Zhu
ENDM
2010
111views more  ENDM 2010»
10 years 1 months ago
Clique and chromatic number of circular-perfect graphs
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr
Arnaud Pêcher, Annegret Katrin Wagler
DAM
2008
134views more  DAM 2008»
10 years 1 months ago
Efficient algorithms for finding critical subgraphs
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...
Christian Desrosiers, Philippe Galinier, Alain Her...
DM
2010
117views more  DM 2010»
10 years 1 months ago
The distinguishing chromatic number of Cartesian products of two complete graphs
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
Janja Jerebic, Sandi Klavzar
CORR
2008
Springer
95views Education» more  CORR 2008»
10 years 1 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic
CORR
2010
Springer
104views Education» more  CORR 2010»
10 years 1 months ago
Coloring translates and homothets of a convex body
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
Adrian Dumitrescu, Minghui Jiang
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
10 years 2 months ago
Coloring powers of planar graphs
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
Geir Agnarsson, Magnús M. Halldórsso...
books