scientific article; zbMATH DE number 434893

zbMATH Open0787.05037MaRDI QIDQ3139747FDOQ3139747

Authors: Marietjie Frick 

Publication date: 26 May 1994

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

partitiondegeneracygraph invariantclique numbermaximum degreecoloringpath number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (11)

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

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)