Pages that link to "Item:Q643026"
From MaRDI portal
The following pages link to Total chromatic number of unichord-free graphs (Q643026):
Displaying 20 items.
- Total-colorings of complete multipartite graphs using amalgamations (Q271641) (← links)
- The homogeneous set sandwich problem (Q293307) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- A new characterization of unichord-free graphs (Q891324) (← links)
- Uniquely total colorable graphs (Q1376076) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- Strongly unichord-free graphs (Q1717190) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- New graph classes characterized by weak vertex separators and two-pairs (Q2409764) (← links)
- When all minimal vertex separators induce complete or edgeless subgraphs (Q2864857) (← links)
- Total chromatic number of \{square,unichord\}-free graphs (Q2883635) (← links)
- (Q2994411) (← links)
- Characterizing k-chordal unichord-free graphs (Q4577849) (← links)
- On the total and AVD-total coloring of graphs (Q4956171) (← links)
- (Q5000291) (← links)
- Uncountable dichromatic number without short directed cycles (Q5110680) (← links)
- Unique chords of unique cycles in 3-connected planar graphs (Q5858165) (← links)