26 search results - page 3 / 6 » The t-Improper Chromatic Number of Random Graphs |
100
click to vote
DAM
2008
14 years 11 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
CPC
2008
14 years 11 months ago
2008
DM
2008
14 years 11 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
IPL
1998
14 years 11 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
SIAMDM
2008
14 years 11 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...