scientific article; zbMATH DE number 4008419

zbMATH Open0622.05026MaRDI QIDQ3758854FDOQ3758854

Authors: James A. Andrews, Michael Jacobson 

Publication date: 1985

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

Recommendations

• scientific article; zbMATH DE number 4051672
• Generalizations of independence and chromatic numbers of a graph
• Ramseyan properties of graphs
• On the chromatic number of the general Kneser-graph
• A generalization of chromatic index

zbMATH Keywords

n-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (32)

• The subchromatic number of a graph
• Additive non-approximability of chromatic number in proper minor-closed classes
• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
• Chromatic zeros and generalized Fibonacci numbers
• Improper colouring of (random) unit disk graphs
• Reflection on the coloring and chromatic numbers
• A generalization of chromatic index
• On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
• Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable
• On the computational complexity of the bipartizing matching problem
• Extremal results on defective colorings of graphs
• Generalizations of independence and chromatic numbers of a graph
• Title not available (Why is that?)
• Defective Coloring on Classes of Perfect Graphs
• On Counting Generalized Colorings
• Parameterized (approximate) defective coloring
• Bounds and fixed-parameter algorithms for weighted improper coloring
• Distributed deterministic edge coloring using bounded neighborhood independence
• Parameterized (approximate) defective coloring
• Title not available (Why is that?)
• Conditional chromatic numbers with forbidden cycles
• General-Appell polynomials within the context of monomiality principle
• On the mean chromatic number
• On the space chromatic number
• Title not available (Why is that?)
• Chromatic sums for colorings avoiding monochromatic subgraphs
• Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
• Bounded families for the on-line \(t\)-relaxed coloring
• On improperly chromatic-choosable graphs
• Co-2-plex vertex partitions
• Improper interval edge colorings of graphs
• Chromatic partitions of a graph

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 Q3758854)