Semi-strong chromatic number of a graph
From MaRDI portal
Publication:1346444
zbMath0820.05024MaRDI QIDQ1346444
L. Pushpa Latha, E. Sampathkumar
Publication date: 4 April 1995
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
partitioncyclesdiameterdegreebipartite graphstreesblock graphswheelscactitight boundssemi-strong chromatic numberstrongly stable set
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
This page was built for publication: Semi-strong chromatic number of a graph