459 search results - page 19 / 92 » Detecting induced subgraphs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
DM
2007
13 years 8 months ago
2007
An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not contain any chordless cy...
TCS
2008
13 years 8 months ago
2008
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...
DM
2002
13 years 8 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
SIAMDM
2002
13 years 8 months ago
2002
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...