Publication:5611635
From MaRDI portal
zbMath0209.55004MaRDI QIDQ5611635
Publication date: 1969
05C15: Coloring of graphs and hypergraphs
Related Items
On the Pseudo-achromatic Number Problem, Graph colourings and partitions, Relations between parameters of a graph, Complete partitions of graphs, On the pseudo-achromatic number problem, Some parameters of graph and its complement, Decomposition of a complete graph into trails of given lengths, Some coloring numbers for complete r-partite graphs, Partition graphs and coloring numbers of a graph, An edge-coloration theorem for bipartite graphs with applications, Pseudoachromatic and connected-pseudoachromatic indices of the complete graph, The Hadwiger number, chordal graphs and \(ab\)-perfection, Local coloring of self complementary graphs, Inequalities involving the irredundance number of a graph, Degrees and degree sequence ofk-edged-critical graphs, Bounding the pseudoachromatic index of the complete graph via projective planes