30 search results - page 4 / 6 » Intriguing Sets of Vertices of Regular Graphs |
JGAA
2006
14 years 9 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
JGAA
2007
14 years 9 months ago
2007
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
CPC
2002
14 years 9 months ago
2002
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
65
Voted
DM
2008
14 years 9 months ago
2008
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...
68
Voted
ESA
2006
Springer
15 years 1 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...