Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Journal of Combinatorial Theory Series B
On-Line and First-Fit Coloring of Graphs That Do Not Induce $P_5$
SIAM Journal on Discrete Mathematics
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Register allocation & spilling via graph coloring
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Combinatorics, Probability and Computing
A New Algorithm for On-line Coloring Bipartite Graphs
SIAM Journal on Discrete Mathematics
Chromatic Graph Theory
On the problem of freeness of multiplicative matrix semigroups
Theoretical Computer Science
Tree Matrices and a Matrix Reduction Algorithm of Belitskii
Fundamenta Informaticae
On the Computational Complexity of Bongartz's Algorithm
Fundamenta Informaticae
Toroidal Algorithms for Mesh Geometries of Root Orbits of the Dynkin Diagram $\mathbb{D}_4$
Fundamenta Informaticae
| Hi-index | 0.00 |
Given a graph H we define ρ(H) to be the minimum order of a graph G such that every proper vertex coloring of G contains a rainbow induced subgraph isomorphic to H. We give upper and lower bounds for ρ(H), compute the exact value for some classes of graphs, and consider an interesting combinatorial problem connected with computation of ρ(H) for paths. A part of this research has been guided by a computer search and, accordingly, some computational results are presented. A special motivation comes from research in on-line coloring.