Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering
From MaRDI portal
Publication:3439078
DOI10.1016/S1571-0653(04)00571-2zbMath1196.05066OpenAlexW1998139882MaRDI QIDQ3439078
Purnima Gupta, E. Sampathkumar, Belmannu Devadas 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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
This page was built for publication: Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering