Pages that link to "Item:Q5532262"
From MaRDI portal
The following pages link to The Colour Numbers of Complete Graphs (Q5532262):
Displaying 45 items.
- On the equitable total chromatic number of cubic graphs (Q298960) (← links)
- Total chromatic number of generalized Mycielski graphs (Q396736) (← links)
- The total chromatic number of split-indifference graphs (Q442393) (← links)
- New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Fractional total colouring (Q807633) (← links)
- A result on the total colouring of powers of cycles (Q875593) (← links)
- Problems related to a de Bruijn-Erdös theorem (Q943846) (← links)
- Total and fractional total colourings of circulant graphs (Q998370) (← links)
- The total chromatic number of regular graphs of high degree (Q1042999) (← links)
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs (Q1173768) (← links)
- Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) (Q1196563) (← links)
- Total chromatic numbers (Q1206208) (← links)
- Nombre chromatique total d'un hypergraphe (Q1219307) (← links)
- The total coloring of a multigraph with maximal degree 4 (Q1259607) (← links)
- Total chromatic number of graphs of odd order and high degree (Q1301827) (← links)
- Simultaneous coloring of edges and faces of plane graphs (Q1322167) (← links)
- Recent developments in total colouring (Q1322273) (← links)
- The total chromatic number of pseudo-outerplanar graphs (Q1377186) (← links)
- Characterizing and edge-colouring split-indifference graphs (Q1383379) (← links)
- A study of the total chromatic number of equibipartite graphs (Q1584229) (← links)
- On the \(b\)-chromatic number of Cartesian products (Q1706119) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- A note on the total chromatic number of Halin graphs with maximum degree 4 (Q1808604) (← links)
- Strong total chromatic numbers of complete hypergraphs (Q1842162) (← links)
- Generalised Ramsey numbers for small graphs (Q1845738) (← links)
- A six-color theorem for the edge-face coloring of plane graphs (Q1894780) (← links)
- Equitable total coloring of corona of cubic graphs (Q2042627) (← links)
- Zero-divisor graphs and total coloring conjecture (Q2156940) (← links)
- On total and edge coloring some Kneser graphs (Q2168715) (← links)
- An upper bound for the total chromatic number (Q2277479) (← links)
- A concise proof for total coloring subcubic graphs (Q2444906) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- \((p,1)\)-total labelling of graphs (Q2467731) (← links)
- Total chromatic number of one kind of join graphs (Q2501562) (← links)
- On the total coloring of certain graphs (Q2544365) (← links)
- A seven-color theorem on the sphere (Q2558864) (← links)
- Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth (Q2561602) (← links)
- On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges. (Q2583545) (← links)
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs (Q2663994) (← links)
- On total coloring the direct product of cycles and bipartite direct product of graphs (Q2699911) (← links)
- On Coloring Problems of Snark Families (Q2840681) (← links)
- The total chromatic number of some bipartite graphs (Q3439400) (← links)
- ON SOME TOTAL GRAPHS ON FINITE RINGS (Q5064399) (← links)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
