66 search results - page 3 / 14 » Balanced coloring of bipartite graphs |
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ARSCOM
2006
13 years 6 months ago
2006
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
DAM
2010
13 years 6 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...
SIAMDM
2010
13 years 22 days ago
2010
Abstract. The conjecture of Bollob
DM
1999
13 years 5 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...