Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering

DOI10.1016/S1571-0653(04)00571-2MaRDI QIDQ3439078zbMATH OpenOpenAlexFDO

Authors E. Sampathkumar, Purnima Gupta, B. D. Acharya

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00571-2

zbMATH Keywords

graphk-chromatic numberk-cliquek-degreek-domination numberk-vertex cover

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers
• scientific article; zbMATH DE number 4057563
• scientific article; zbMATH DE number 2544
• scientific article; zbMATH DE number 4070954
• scientific article; zbMATH DE number 1161247

Cited in

(1)

• Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers

This page was built for publication: Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering

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