Pages that link to "Item:Q1383379"
From MaRDI portal
The following pages link to Characterizing and edge-colouring split-indifference graphs (Q1383379):
Displaying 13 items.
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- The total chromatic number of split-indifference graphs (Q442393) (← links)
- On edge-colouring indifference graphs (Q1391299) (← 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)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Vector domination in split-indifference graphs (Q2281167) (← links)
- Edge Coloring of Split Graphs (Q3503526) (← links)
- Counting and enumerating unlabeled split–indifference graphs (Q5370830) (← links)
- Partitioning a graph into complementary subgraphs (Q5918340) (← links)
- The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← links)
