Pages that link to "Item:Q389214"
From MaRDI portal
The following pages link to Edge-colouring and total-colouring chordless graphs (Q389214):
Displaying 23 items.
- Total-chromatic number and chromatic index of dually chordal graphs (Q294687) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
- Necessary edges in \(k\)-chordalisations of graphs (Q1417852) (← links)
- Strongly unichord-free graphs (Q1717190) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← links)
- Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs (Q2111937) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring (Q2173433) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Wheel-free planar graphs (Q2349958) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- (Q3610589) (← links)
- (Q3741636) (← links)
- (Q3987044) (← links)
- Characterizing k-chordal unichord-free graphs (Q4577849) (← links)
- On Efficient Coloring of Chordless Graphs (Q4931915) (← links)
- Acyclic chromatic index of chordless graphs (Q6041561) (← links)
- The proper 2-connection number of several graph classes (Q6633520) (← links)
