• Corpus ID: 237494390

# Exact defective colorings of graphs

@article{Cumberbatch2021ExactDC,
title={Exact defective colorings of graphs},
author={James Cumberbatch and Juho Lauri and Christodoulos Mitillos},
journal={ArXiv},
year={2021},
volume={abs/2109.05255}
}
• Published 11 September 2021
• Computer Science, Mathematics
• ArXiv
An exact (k, d)-coloring of a graph G is a coloring of its vertices with k colors such that each vertex v is adjacent to exactly d vertices having the same color as v. The exact d-defective chromatic number, denoted χd (G), is the minimum k such that there exists an exact (k, d)-coloring of G. In an exact (k, d)-coloring, which for d = 0 corresponds to a proper coloring, each color class induces a d-regular subgraph. We give basic properties for the parameter and determine its exact value for…

## References

SHOWING 1-10 OF 22 REFERENCES
Defective coloring revisited
• Computer Science
J. Graph Theory
• 1997
This paper investigates the existence of such colorings in surfaces and the complexity of coloring problems, and shows that the (2, k)-coloring, for k ≥ 1, and the (3, 1-coloring problems are NP-complete even for planar graphs.
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Mathematics, Computer Science
J. Graph Theory
• 1986
It is proved that, for each compact surface S, there is an integer k = k(S) such that every graph in S can be (4, k)-colored; the conjecture that 4 can be replaced by 3 in this statement is conjecture.
Partition the vertices of a graph into induced matchings
• Computer Science, Mathematics
Discret. Math.
• 2003
The induced matching partition number of a graph G, denoted by imp(G), is the minimum integer k such that V(G) has a k-partition (V1, V2,..., Vk) such that, for each i, 1 ≤ i ≤ k, G[Vi], the subgraph
Parameterized (Approximate) Defective Coloring
• Mathematics, Computer Science
STACS
• 2018
The complexity of Defective Coloring is investigated, and an ETH-based lower bound for treewidth and pathwidth is given, showing that no algorithm can solve the problem in $n^{o(pw)}$, essentially matching the complexity of an algorithm obtained with standard techniques.
A Survey of (m, k)-Colorings
Abstract For a given graph invariant γ an (m, k)γ -coloring of a graph G is a partition of the vertex set of G into m subsets V1,…, V1 such that γ( ) ≤kfor i = 1,…, m. Various aspects of (m,
Efficient vertex- and edge-coloring of outerplanar graphs
• Mathematics
• 1986
The problems of finding values of the chromatic number and the chromatic index of a graph are NP-hard even for some restricted classes of graphs. Every outerplanar graph has an associated tree
Defective Coloring on Classes of Perfect Graphs
• Mathematics, Computer Science
WG
• 2017
It is shown that it is NP-hard on split graphs, even when one of the two parameters $$\mathrm {\chi _d},\varDelta ^*$$ is set to the smallest possible fixed value that does not trivialize the problem.
An Annotated Glossary of Graph Theory Parameters, with Conjectures
• Mathematics
• 2018
This glossary contains an annotated listing of some 300 parameters of graphs, together with their definitions, and, for most of these, a reference to the authors who introduced them. Let G = (V, E)
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
It is shown that two sorts of problems belong to the NP-complete class, and a result by Garey, Johnson, and Stockmeyer is extended with a proof that the coloring of four-regular planar graphs is NP- complete.
Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs
• Computer Science, Mathematics
Discret. Appl. Math.
• 1998
It is shown that there is a linear-time greedy algorithm for a maximum matching in a strongly chordal graph provided a strongly perfect elimination ordering is known and this algorithm can be turned into a parallel algorithm.