Pages that link to "Item:Q932681"
From MaRDI portal
The following pages link to Multicoloring and Mycielski construction (Q932681):
Displaying 13 items.
- \(k\)-fold coloring of planar graphs (Q625874) (← links)
- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
- Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
- The fractional chromatic number of generalized cones over graphs (Q2138562) (← links)
- Colouring multijoints (Q2514230) (← links)
- Fractional chromatic numbers of cones over graphs (Q2757095) (← links)
- k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS (Q3087093) (← links)
- Multi-coloring the Mycielskian of graphs (Q3553236) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Multicolor Discrepancy of Arithmetic Structures (Q5264195) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- On multichromatic numbers of widely colorable graphs (Q6081566) (← links)
