Pages that link to "Item:Q3553236"
From MaRDI portal
The following pages link to Multi-coloring the Mycielskian of graphs (Q3553236):
Displaying 15 items.
- \(k\)-fold coloring of planar graphs (Q625874) (← links)
- Multicoloring and Mycielski construction (Q932681) (← links)
- Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
- On optimal \(k\)-fold colorings of webs and antiwebs (Q1759864) (← links)
- Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
- On the multiple Borsuk numbers of sets (Q2017114) (← links)
- Incidence coloring of mycielskians with fast algorithm (Q2043007) (← links)
- Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
- On multiset colorings of graphs (Q3059086) (← links)
- (Q3170397) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- (Q5477332) (← links)
- The exponential growth of the packing chromatic number of iterated Mycielskians (Q6069170) (← links)
