50 search results - page 3 / 10 » Colorful subgraphs in Kneser-like graphs |
RSA
2011
13 years 1 months ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
IWOCA
2009
Springer
14 years 24 days ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
ENDM
2008
13 years 6 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
ICPR
2004
IEEE
14 years 7 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
ENDM
2000
13 years 6 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...