scientific article; zbMATH DE number 434893

MaRDI QIDQ3139747zbMATH OpenFDO

Authors Marietjie Frick

Publication date 26 May 1994

zbMATH Keywords

clique numbercoloringdegeneracygraph invariantmaximum degreepartitionpath number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 1433954
• Generalizations of independence and chromatic numbers of a graph
• Chromatic partitions of a graph
• Extremal results on defective colorings of graphs
• \((k,j)\)-coloring of sparse graphs

Cited in

(11)

• Minimum partition of an independence system into independent sets
• Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces
• Minimal reducible bounds for induced-hereditary properties
• Parameterized (approximate) defective coloring
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
• scientific article; zbMATH DE number 1553748 (Why is no real title available?)
• Parameterized (approximate) defective coloring
• On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
• Colorings of the Graph K ᵐ 2 + Kn
• Defective Coloring on Classes of Perfect Graphs
• Bounds and fixed-parameter algorithms for weighted improper coloring

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139747)