Chromatic partitions of a graph

DOI10.1016/0012-365X(89)90211-2MaRDI QIDQ1263595zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Generalizations of independence and chromatic numbers of a graph
• Independent sets in k-chromatic graphs
• On the partition and coloring of a graph by cliques
• scientific article; zbMATH DE number 3251276
• scientific article; zbMATH DE number 4162925

Cites work

• k-Degenerate Graphs
• An inequality for the chromatic number of a graph
• An interpolation theorem for partitions which are complete with respect to hereditary properties
• Generalizations of independence and chromatic numbers of a graph
• scientific article; zbMATH DE number 3885934 (Why is no real title available?)
• scientific article; zbMATH DE number 3912409 (Why is no real title available?)
• scientific article; zbMATH DE number 4008419 (Why is no real title available?)
• scientific article; zbMATH DE number 3661340 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3276423 (Why is no real title available?)
• scientific article; zbMATH DE number 3339167 (Why is no real title available?)
• scientific article; zbMATH DE number 3400927 (Why is no real title available?)
• On Complementary Graphs
• On critical subgraphs of colour-critical graphs
• On generalized graph colorings
• On the Point-Arboricity of a Graph and its Complement
• Parallel concepts in graph theory
• The Eigenvalues of a Graph and Its Chromatic Number
• The point-arboricity of a graph
• The Point-Arboricity of Planar Graphs
• The subchromatic number of a graph

Cited in

(23)

• Minimum partition of an independence system into independent sets
• A sequential coloring algorithm for finite sets
• The existence of uniquely \(-G\) colourable graphs
• A chromatic partition polynomial
• Generalizations of independence and chromatic numbers of a graph
• The complexity of generalized graph colorings
• Partitioning and coloring graphs with degree constraints
• Point partition numbers: decomposable and indecomposable critical graphs
• (k,r,t)-chromatic partitions of a graph
• scientific article; zbMATH DE number 434893 (Why is no real title available?)
• scientific article; zbMATH DE number 4162925 (Why is no real title available?)
• scientific article; zbMATH DE number 4010539 (Why is no real title available?)
• scientific article; zbMATH DE number 4021173 (Why is no real title available?)
• scientific article; zbMATH DE number 4031746 (Why is no real title available?)
• scientific article; zbMATH DE number 4053648 (Why is no real title available?)
• The chromatic number of extended odd graphs is four
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• scientific article; zbMATH DE number 637288 (Why is no real title available?)
• scientific article; zbMATH DE number 7528087 (Why is no real title available?)
• k-chromatic number of graphs on surfaces
• scientific article; zbMATH DE number 2201825 (Why is no real title available?)
• scientific article; zbMATH DE number 7651226 (Why is no real title available?)
• Bibliography on domination in graphs and some basic definitions of domination parameters

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

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