Partition graphs and coloring numbers of a graph

DOI10.1016/0012-365X(76)90093-5zbMath0337.05110MaRDI QIDQ1229883

V. N. Bhave, E. Sampathkumar

Publication date: 1976

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

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On the Pseudo-achromatic Number Problem ⋮ Some results on generalized self-complementary graphs ⋮ Complete partitions of graphs ⋮ On the pseudo-achromatic number problem ⋮ Inequalities involving the irredundance number of a graph

Cites Work

• Parallel concepts in graph theory
• The achromatic number of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Partition graphs and coloring numbers of a graph