2,256 research outputs found
A note on one-sided interval edge colorings of bipartite graphs
For a bipartite graph with parts and , an -interval coloring is
a proper edge coloring of by integers such that the colors on the edges
incident to any vertex in form an interval. Denote by
the minimum such that has an -interval coloring with colors. The
author and Toft conjectured [Discrete Mathematics 339 (2016), 2628--2639] that
there is a polynomial such that if has maximum degree at most
, then . In this short note, we prove
this conjecture; in fact, we prove that a cubic polynomial suffices. We also
deduce some improved upper bounds on for bipartite graphs
with small maximum degree
Independent Sets in Graphs with an Excluded Clique Minor
Let be a graph with vertices, with independence number , and
with with no -minor for some . It is proved that
Hadwiger's conjecture for graphs with forbidden holes
Given a graph , the Hadwiger number of , denoted by , is the
largest integer such that contains the complete graph as a minor.
A hole in is an induced cycle of length at least four. Hadwiger's
Conjecture from 1943 states that for every graph , , where
denotes the chromatic number of . In this paper we establish more
evidence for Hadwiger's conjecture by showing that if a graph with
independence number has no hole of length between and
, then . We also prove that if a graph with
independence number has no hole of length between and
, then contains an odd clique minor of size , that is,
such a graph satisfies the odd Hadwiger's conjecture
Cyclic Coloring of Plane Graphs with Maximum Face Size 16 and 17
Plummer and Toft conjectured in 1987 that the vertices of every 3-connected
plane graph with maximum face size D can be colored using at most D+2 colors in
such a way that no face is incident with two vertices of the same color. The
conjecture has been proven for D=3, D=4 and D>=18. We prove the conjecture for
D=16 and D=17
- …