Pages that link to "Item:Q909667"
From MaRDI portal
The following pages link to Determining the total colouring number is NP-hard (Q909667):
Displaying 18 items.
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- The total chromatic number of some bipartite graphs (Q3439400) (← links)
- Approximation of 3-Edge-Coloring of Cubic Graphs (Q3503456) (← links)
- An Algorithmic Approach to Equitable Total Chromatic Number of Graphs (Q4634467) (← links)
- Total colorings of circulant graphs (Q5025120) (← links)
- Total coloring of quasi-line graphs and inflated graphs (Q5025132) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES (Q5248998) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
- (Q5708488) (← links)
- Edge and total coloring of interval graphs (Q5954080) (← links)
- Results about the total chromatic number and the conformability of some families of circulant graphs (Q6094719) (← links)
- (Q6150943) (← links)
- Various matching keys for asymmetric topology encryption (Q6180574) (← links)
- On the conformability of regular line graphs (Q6181221) (← links)
- Total coloring of some graph operations (Q6547840) (← links)
- Equitable total coloring of Fibonacci graphs (Q6583579) (← links)
- New results on edge-coloring and total-coloring of split graphs (Q6648272) (← links)
- Total colorings of some classes of four regular circulant graphs (Q6651146) (← links)