The Colour Numbers of Complete Graphs
From MaRDI portal
Cited in
(63)- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- \((p,1)\)-total labelling of graphs
- On some total graphs on finite rings
- Total chromatic number of generalized Mycielski graphs
- Zero-divisor graphs and total coloring conjecture
- Gain total graphs and their spectra via G-phases and group representations
- Total coloring of graphs associated with algebraic structures and ordered structures
- Total coloring of middle graph of certain snake graph families
- On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges.
- Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
- Characterizing and edge-colouring split-indifference graphs
- Total chromatic number of graphs of odd order and high degree
- On total and edge coloring some Kneser graphs
- Strong total chromatic numbers of complete hypergraphs
- Adjacent vertex distinguishing total coloring of corona product of graphs
- On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs
- Simultaneous coloring of edges and faces of plane graphs
- On the equitable total chromatic number of cubic graphs
- THE EDGE-CHROHATIC NUMBER OF A CIRCULANT
- Colorings of the Graph K ᵐ 2 + Kn
- Equitable total coloring of corona of cubic graphs
- Some results on (strong) total proper connection number of some digraphs
- A study of the total chromatic number of equibipartite graphs
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- Computation of total chromatic number for certain convex polytope graphs
- Filling some gaps on the edge coloring problem of split graphs
- Recent developments in total colouring
- The total chromatic number of graphs having large maximum degree
- A seven-color theorem on the sphere
- Total chromatic numbers
- A concise proof for total coloring subcubic graphs
- The hunting of a snark with total chromatic number 5
- Total chromatic number of one kind of join graphs
- On the total coloring of certain graphs
- Total and fractional total colourings of circulant graphs
- Problems related to a de Bruijn-Erdös theorem
- Total dominator total coloring of a graph
- The total chromatic number of some bipartite graphs
- The total chromatic number of regular graphs of high degree
- The total coloring of a multigraph with maximal degree 4
- New results on edge-coloring and total-coloring of split graphs
- The chromaticity of complete split graphs
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- A note on the total chromatic number of Halin graphs with maximum degree 4
- A six-color theorem for the edge-face coloring of plane graphs
- A result on the total colouring of powers of cycles
- Generalised Ramsey numbers for small graphs
- On the b-chromatic number of Cartesian products
- Fractional total colouring
- Incident vertex pi coloring of middle, total, line and splitting graph for star and double star graph families
- An upper bound for the total chromatic number
- Nombre chromatique total d'un hypergraphe
- On total coloring the direct product of cycles and bipartite direct product of graphs
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
- Total coloring of rooted path graphs
- On coloring problems of snark families
- The total chromatic number of pseudo-outerplanar graphs
- Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth
- The total chromatic number of split-indifference graphs
- scientific article; zbMATH DE number 2230202 (Why is no real title available?)
- Total coloring of some graph operations
- On the total chromatic number of the direct product of cycles and complete graphs
- New families of n-clusters verifying the Erdős-Faber-Lovász conjecture
This page was built for publication: The Colour Numbers of Complete Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5532262)