The following pages link to (Q4697576):
Displaying 18 items.
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- The total chromatic number of split-indifference graphs (Q442393) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
- Total coloring of claw-free planar graphs (Q2151210) (← links)
- Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
- Edge Coloring of Split Graphs (Q3503526) (← links)
- On the total and AVD-total coloring of graphs (Q4956171) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)
- The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← links)
- Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs (Q6145813) (← links)