Partition graphs and coloring numbers of a graph

DOI10.1016/0012-365X(76)90093-5MaRDI QIDQ1229883zbMATH OpenFDO

Authors E. Sampathkumar, V. N. Bhave

Publication date 1976

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3298599 (Why is no real title available?)
• scientific article; zbMATH DE number 3334007 (Why is no real title available?)
• Parallel concepts in graph theory
• The achromatic number of a graph

Cited in

(5)

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

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

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