Some defective parameters in graphs

DOI10.1007/s00373-011-1111-5zbMath1263.05028OpenAlexW2017956688MaRDI QIDQ1950405

Tınaz Ekim, John G. Gimbel

Publication date: 13 May 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1111-5

zbMATH Keywords

k-defective cocoloringk-defective coloringk-dense setk-sparse set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Maximum weight t-sparse set problem on vector-weighted graphs ⋮ Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs ⋮ Advances on defective parameters in graphs ⋮ Small 1-defective Ramsey numbers in perfect graphs ⋮ Exact values of defective Ramsey numbers in graph classes ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cocolourings and cochromatic numbers of graphs
• Extremal results on defective colorings of graphs
• Subcolorings and the subchromatic number of a graph
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Some extremal results in cochromatic and dichromatic theory
• On 1-dependent ramsey numbers for graphs
• Graph colouring and the probabilistic method

This page was built for publication: Some defective parameters in graphs