Pages that link to "Item:Q759160"
From MaRDI portal
The following pages link to On critical subgraphs of colour-critical graphs (Q759160):
Displaying 19 items.
- Five-coloring graphs on the Klein bottle (Q713974) (← links)
- Graph coloring satisfying restraints (Q910410) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Dwarf, brick, and triangulation of the torus (Q1096655) (← links)
- Subgraphs of colour-critical graphs (Q1101121) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- A vertex critical graph without critical edges (Q1193438) (← links)
- Hajos' graph-coloring conjecture: Variations and counterexamples (Q1249185) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
- A Brooks type theorem for the maximum local edge connectivity (Q1753016) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
- On complete subgraphs of color-critical graphs (Q1897440) (← links)
- Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs (Q1906843) (← links)
- Tools for counting odd cycles in graphs (Q2338636) (← links)
- On generalized graph colorings (Q3748295) (← links)
- Small graphs with chromatic number 5: A computer search (Q4320470) (← links)
- Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces (Q5232160) (← links)
