Pages that link to "Item:Q5931450"
From MaRDI portal
The following pages link to 25 pretty graph colouring problems (Q5931450):
Displaying 50 items.
- Facial colorings using Hall's theorem (Q966152) (← links)
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) (Q968410) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- On multiples of simple graphs and Vizing's theorem (Q982630) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces (Q998357) (← links)
- The strong chromatic index of a class of graphs (Q998363) (← links)
- Structural properties and edge choosability of planar graphs without 4-cycles (Q998462) (← links)
- On 3-colorable planar graphs without short cycles (Q998606) (← links)
- A distance-labelling problem for hypercubes (Q1005224) (← links)
- The edge version of Hadwiger's conjecture (Q1011784) (← links)
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
- Linear time self-stabilizing colorings (Q1014432) (← links)
- Achieving maximum chromatic index in multigraphs (Q1025461) (← links)
- Self-stabilizing coloration in anonymous planar networks (Q1041773) (← links)
- The Erdős-Lovász tihany conjecture for quasi-line graphs (Q1043565) (← links)
- An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs (Q1043651) (← links)
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
- Injective colorings of planar graphs with few colors (Q1045050) (← links)
- 3-maps (Q1045127) (← links)
- On the roots of chromatic polynomials (Q1272480) (← links)
- Borel chromatic numbers (Q1279827) (← links)
- Every circle graph of girth at least 5 is 3-colourable (Q1296984) (← links)
- Edge-choosability of multicircuits (Q1301722) (← links)
- A bound on the strong chromatic index of a graph (Q1354718) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- On the optimal transversals of the odd cycles (Q1357734) (← links)
- A new proof of Grünbaum's 3 color theorem (Q1357735) (← links)
- On extensions of a conjecture of Gallai (Q1362102) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Mixed dominating matrices (Q1377507) (← links)
- The pagenumber of toroidal graphs is at most seven (Q1377749) (← links)
- Topological minors in graphs of large girth (Q1403927) (← links)
- On the size of edge chromatic critical graphs (Q1403929) (← links)
- A sufficient condition for planar graphs to be 3-colorable (Q1405097) (← links)
- A worthy family of semisymmetric graphs (Q1408884) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- Coloring planar Toeplitz graphs and the stable set polytope. (Q1422423) (← links)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
- On sparse graphs with given colorings and homomorphisms. (Q1425116) (← links)
- Short solution of Kotzig's problem for bipartite graphs (Q1569037) (← links)
- On list edge-colorings of subcubic graphs (Q1584301) (← links)
- On universal graphs for planar oriented graphs of a given girth (Q1584330) (← links)
- On the small graphs with chromatic number 5 without 4-cliques (Q1584347) (← links)
- On uniquely \(3\)-colorable graphs. II (Q1584365) (← links)
- Coloring of integer distance graphs (Q1584411) (← links)
- On uniquely partitionable planar graphs (Q1584417) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
