The Colour Numbers of Complete Graphs
From MaRDI portal
Publication:5532262
DOI10.1112/jlms/s1-42.1.226zbMath0152.41203OpenAlexW2146117644MaRDI QIDQ5532262
Gary Chartrand, Mehdi Behzad, John K. jun. Cooper
Publication date: 1967
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-42.1.226
Related Items
On the equitable total chromatic number of cubic graphs, A six-color theorem for the edge-face coloring of plane graphs, Zero-divisor graphs and total coloring conjecture, On total and edge coloring some Kneser graphs, The total chromatic number of pseudo-outerplanar graphs, A result on the total colouring of powers of cycles, Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs, Characterizing and edge-colouring split-indifference graphs, Total chromatic number of generalized Mycielski graphs, Weakening total coloring conjecture and Hadwiger's conjecture on total graphs, On the \(b\)-chromatic number of Cartesian products, The total chromatic number of split-indifference graphs, Total coloring of rooted path graphs, On total coloring the direct product of cycles and bipartite direct product of graphs, A concise proof for total coloring subcubic graphs, Unnamed Item, ON SOME TOTAL GRAPHS ON FINITE RINGS, The hunting of a snark with total chromatic number 5, Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs, Problems related to a de Bruijn-Erdös theorem, New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture, THE EDGE-CHROHATIC NUMBER OF A CIRCULANT, \((p,1)\)-total labelling of graphs, Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\), The total chromatic number of graphs having large maximum degree, Total chromatic numbers, Nombre chromatique total d'un hypergraphe, Total chromatic number of one kind of join graphs, An upper bound for the total chromatic number, Total and fractional total colourings of circulant graphs, Equitable total coloring of corona of cubic graphs, The total coloring of a multigraph with maximal degree 4, A note on the total chromatic number of Halin graphs with maximum degree 4, Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44, On the total coloring of certain graphs, Unnamed Item, A seven-color theorem on the sphere, On Coloring Problems of Snark Families, Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth, The total chromatic number of regular graphs of high degree, Strong total chromatic numbers of complete hypergraphs, A study of the total chromatic number of equibipartite graphs, Generalised Ramsey numbers for small graphs, Total chromatic number of graphs of odd order and high degree, Colorings of the Graph K ᵐ 2 + Kn, On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges., The total chromatic number of some bipartite graphs, On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs, Fractional total colouring, Simultaneous coloring of edges and faces of plane graphs, Recent developments in total colouring
