Generalizations of independence and chromatic numbers of a graph

DOI10.1016/0012-365X(93)90493-DzbMath0774.05041MaRDI QIDQ1801703

E. Sampathkumar

Publication date: 20 June 1993

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

zbMATH Keywords

independencechromatic numbergeneralized graph colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Distance \(r\)-domination number and \(r\)-independence complexes of graphs ⋮ Higher Independence Complexes of graphs and their homotopy types ⋮ The complexity of generalized graph colorings ⋮ Chromatic partitions of a graph ⋮ A generalization of chromatic index

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On critical subgraphs of colour-critical graphs
• Chromatic partitions of a graph
• Parallel concepts in graph theory
• The point-arboricity of a graph
• On generalized graph colorings
• The Point-Arboricity of Planar Graphs