Pages that link to "Item:Q5931450"
From MaRDI portal
The following pages link to 25 pretty graph colouring problems (Q5931450):
Displaying 50 items.
- An approximation algorithm for maximum packing of 3-edge paths (Q287133) (← links)
- A note on the size of edge-chromatic 4-critical graphs (Q294519) (← links)
- On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Star chromatic bounds (Q327688) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (Q512552) (← links)
- Upper bounds for the achromatic and coloring numbers of a graph (Q516843) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Interval coloring of (3, 4)-biregular bigraphs having two (2,3)-biregular bipartite subgraphs (Q548414) (← links)
- Bounds for chromatic number in terms of even-girth and booksize (Q616000) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- On the max coloring problem (Q690449) (← links)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- On a hypercube coloring problem (Q703683) (← links)
- A note on the acyclic 3-choosability of some planar graphs (Q708344) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Splits of circuits (Q710606) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- Asymptotic probabilities of extension properties and random \(l\)-colourable structures (Q764265) (← links)
- Colouring the discretization graphs arising in the multigrid method (Q805184) (← links)
- \(\Delta \)-list vertex coloring in linear time (Q844167) (← links)
- A note on 2-facial coloring of plane graphs (Q844207) (← links)
- A note on the not 3-choosability of some families of planar graphs (Q845679) (← links)
- The game chromatic number and the game colouring number of cactuses (Q845991) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- On the chromatic number and independence number of hypergraph products (Q858686) (← links)
- \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- \([r,s,t]\)-colorings of graphs (Q864161) (← links)
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs (Q868364) (← links)
- On invariants of hereditary graph properties (Q868369) (← links)
- Generalised game colouring of graphs (Q878606) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- Online interval coloring with packing constraints (Q954991) (← links)
- Nowhere-zero 3-flows in triangularly connected graphs (Q958692) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Facial colorings using Hall's theorem (Q966152) (← links)
