The following pages link to Wensong Lin (Q247868):
Displaying 50 items.
- An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
- Injective coloring of planar graphs with girth 6 (Q389479) (← links)
- Injective coloring of plane graphs with girth 5 (Q393179) (← links)
- On linear coloring of planar graphs with small girth (Q400495) (← links)
- Group path covering and \(L(j,k)\)-labelings of diameter two graphs (Q413258) (← links)
- A proof of a conjecture on multiset coloring the powers of cycles (Q456085) (← links)
- On \((s,t)\)-relaxed strong edge-coloring of graphs (Q511712) (← links)
- On 2-distance coloring of plane graphs with girth 5 (Q516880) (← links)
- On time-relaxed broadcasting networks (Q708331) (← links)
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037) (← links)
- Entire coloring of plane graph with maximum degree eleven (Q740657) (← links)
- Distance two labelling and direct products of graphs (Q932631) (← links)
- Multicoloring and Mycielski construction (Q932681) (← links)
- Circular consecutive choosability of graphs (Q947046) (← links)
- The strong chromatic index of a class of graphs (Q998363) (← links)
- Star matching and distance two labelling (Q1025703) (← links)
- Circular game chromatic number of graphs (Q1043981) (← links)
- Some star extremal circulant graphs (Q1408873) (← links)
- Circular chromatic number and a generalization of the construction of Mycielski. (Q1417963) (← links)
- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
- Circular chromatic numbers of some distance graphs (Q1773363) (← links)
- On circular-\(L\)(2,1)-edge-labeling of graphs (Q1936087) (← links)
- Group path covering and distance two labeling of graphs (Q1944096) (← links)
- Distance two edge labelings of lattices (Q1956249) (← links)
- Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
- Fashion game on planar graphs (Q2141096) (← links)
- Fashion game on graphs (Q2218646) (← links)
- Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice (Q2343988) (← links)
- A concise proof for total coloring subcubic graphs (Q2444906) (← links)
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice (Q2445232) (← links)
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs (Q2471059) (← links)
- Several parameters of generalized Mycielskians (Q2495898) (← links)
- \(L(1, 2)\)-edge-labelings for lattices (Q2514965) (← links)
- Coloring of distance graphs with intervals as distance sets (Q2567207) (← links)
- (Q2715941) (← links)
- (Q2804784) (← links)
- (Q2846633) (← links)
- On multiset colorings of generalized corona graphs (Q2955917) (← links)
- (Q3052599) (← links)
- (Q3193800) (← links)
- (Q3297154) (← links)
- (Q3501345) (← links)
- (Q3513163) (← links)
- Multi-coloring the Mycielskian of graphs (Q3553236) (← links)
- (Q3572431) (← links)
- (Q3574668) (← links)
- (Q4387903) (← links)
