Pages that link to "Item:Q490994"
From MaRDI portal
The following pages link to Coloring digraphs with forbidden cycles (Q490994):
Displaying 19 items.
- The \(m\)-degenerate chromatic number of a digraph (Q267198) (← links)
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Paths, cycles and circular colorings in digraphs (Q1019171) (← links)
- Monochromatic directed walks in arc-colored directed graphs (Q1088681) (← links)
- Cycle lengths and minimum degree of graphs (Q1682209) (← links)
- Cycles and new bounds for the chromatic number (Q2111913) (← links)
- Cycles in color-critical graphs (Q2121717) (← links)
- Planar Digraphs of Digirth Five Are 2-Colorable (Q2978182) (← links)
- (Q3576672) (← links)
- Cycles with two blocks in <i>k</i>‐chromatic digraphs (Q4581286) (← links)
- A Strengthening on Odd Cycles in Graphs of Given Chromatic Number (Q5157394) (← links)
- Coloring dense digraphs (Q5919339) (← links)
- Complete directed minors and chromatic number (Q6046643) (← links)
- On coloring digraphs with forbidden induced subgraphs (Q6074583) (← links)
- Congruence of cycle lengths and chromatic number (Q6143384) (← links)
- Subdivisions with congruence constraints in digraphs of large chromatic number (Q6183432) (← links)
- 4-Chromatic graphs have at least four cycles of length 0 mod 3 (Q6574399) (← links)
- A quick way to verify if a graph is 3-colorable (Q6633531) (← links)
- \((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number (Q6671592) (← links)
