Pages that link to "Item:Q686156"
From MaRDI portal
The following pages link to The total chromatic number of graphs having large maximum degree (Q686156):
Displaying 37 items.
- Total coloring of certain classes of product graphs (Q327644) (← links)
- Total chromatic number of generalized Mycielski graphs (Q396736) (← links)
- Graphs with chromatic number close to maximum degree (Q409481) (← links)
- Fractional total colourings of graphs of high girth (Q651031) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- \([r,s,t]\)-colorings of graphs (Q864161) (← links)
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs (Q868364) (← links)
- The total chromatic number of pseudo-Halin graphs with lower degree (Q1011742) (← links)
- The total chromatic number of regular graphs of high degree (Q1042999) (← links)
- Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) (Q1196563) (← links)
- Total chromatic number of graphs of odd order and high degree (Q1301827) (← links)
- Totally critical even order graphs (Q1306315) (← links)
- The total chromatic number of regular graphs whose complement is bipartite (Q1318798) (← links)
- Recent developments in total colouring (Q1322273) (← links)
- The chromatic index of graphs of high maximum degree (Q1356656) (← links)
- Total colourings of planar graphs with large girth (Q1378290) (← links)
- The total chromatic number of graphs of even order and high degree (Q1408886) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- The structure of totally critical graphs of odd order (Q1810647) (← links)
- Generalization of two results of Hilton on total-colourings of a graph (Q1893175) (← links)
- Total chromatic number of regular graphs of odd order and high degree (Q1918537) (← links)
- On the set of circular total chromatic numbers of graphs (Q1939589) (← links)
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
- On total colourings of graphs (Q2277476) (← links)
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102) (← links)
- The total chromatic number of regular graphs of even order and high degree (Q2570116) (← links)
- An extension of Vizing's theorem (Q3129828) (← links)
- Total Colourings of Graphs (Q3775574) (← links)
- Totally colouring a graph with maximum degree four (Q3981368) (← links)
- The Total Chromatic Number of Graphs of High Minimum Degree (Q4009489) (← links)
- (Q4022830) (← links)
- On graphs having prescribed clique number, chromatic number, and maximum degree (Q4186359) (← links)
- Total Chromatic Number of Graphs of Order 2<i>n</i> + l having Maximum Degree 2<i>n</i> − 1 (Q4894516) (← links)
- Total coloring of the prismatic graphs (Q4965901) (← links)
- Total coloring of quasi-line graphs and inflated graphs (Q5025132) (← links)
- Total coloring conjecture on certain classes of product graphs (Q6164667) (← links)
- On the total chromatic number of the direct product of cycles and complete graphs (Q6550907) (← links)
