Chromatic partitions of a graph

DOI10.1016/0012-365X(89)90211-2zbMath0688.05028OpenAlexW1964998024MaRDI QIDQ1263595

E. Sampathkumar, C. V. Venkatachalam

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90211-2

zbMATH Keywords

\(P_ k\)-colouring\(P_ k\)-setchromatic partition numbergeneral chromatic number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

The existence of uniquely \(-G\) colourable graphs ⋮ The complexity of generalized graph colorings ⋮ ON UNIQUELY -G k-COLOURABLE GRAPHS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Generalizations of independence and chromatic numbers of a graph ⋮ Minimum partition of an independence system into independent sets ⋮ A sequential coloring algorithm for finite sets ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• On critical subgraphs of colour-critical graphs
• Parallel concepts in graph theory
• Generalizations of independence and chromatic numbers of a graph
• The subchromatic number of a graph
• The point-arboricity of a graph
• An interpolation theorem for partitions which are complete with respect to hereditary properties
• On Complementary Graphs
• On generalized graph colorings
• The Eigenvalues of a Graph and Its Chromatic Number
• An inequality for the chromatic number of a graph
• The Point-Arboricity of Planar Graphs
• On the Point-Arboricity of a Graph and its Complement
• k-Degenerate Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chromatic partitions of a graph