Extremal results on defective colorings of graphs

DOI10.1016/0012-365X(94)90260-7zbMath0794.05029OpenAlexW1965917252MaRDI QIDQ1318803

Michael A. Henning, Marietjie Frick

Publication date: 4 April 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90260-7

zbMATH Keywords

extremal graphschromatic numberdefective chromatic number sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Minimal vertex Ramsey graphs and minimal forbidden subgraphs ⋮ Unnamed Item ⋮ The complexity of generalized graph colorings ⋮ Parameterized (Approximate) Defective Coloring ⋮ Graph partitions under average degree constraint ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ Some defective parameters in graphs ⋮ On generalized choice and coloring numbers ⋮ On t-relaxed chromatic number of r-power paths ⋮ Improper colouring of (random) unit disk graphs ⋮ On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number ⋮ Bounds and fixed-parameter algorithms for weighted improper coloring ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ Relaxed equitable colorings of planar graphs with girth at least 8 ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ On uniquely partitionable planar graphs ⋮ Defective Coloring on Classes of Perfect Graphs

Cites Work

• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• On generalized graph colorings
• A note on defective colorings of graphs in surfaces
• Uniquely Colourable Graphs with Large Girth
• Uniquely colorable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item