The following pages link to Jian Liang Wu (Q592984):
Displaying 50 items.
- (Q281775) (redirect page) (← links)
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- (Q360966) (redirect page) (← links)
- Total colorings of planar graphs with small maximum degree (Q360968) (← links)
- Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973) (← links)
- Total coloring of planar graphs with 7-cycles containing at most two chords (Q391771) (← links)
- Total coloring of embedded graphs with maximum degree at least seven (Q391777) (← links)
- Edge colorings of planar graphs without 5-cycles with two chords (Q391789) (← links)
- Total coloring of planar graphs with maximum degree 8 (Q393898) (← links)
- Equitable vertex arboricity of graphs (Q394205) (← links)
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8 (Q405156) (← links)
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- A note on the total coloring of planar graphs without adjacent 4-cycles (Q427837) (← links)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- Edge covering pseudo-outerplanar graphs with forests (Q449118) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q476647) (← links)
- Some sufficient conditions for 1-planar graphs to be class 1 (Q484318) (← links)
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle (Q489715) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
- On \((p,1)\)-total labelling of planar graphs (Q512891) (← links)
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (Q520529) (← links)
- Neighbor sum distinguishing edge coloring of subcubic graphs (Q523715) (← links)
- A sufficient condition for a planar graph to be 4-choosable (Q526822) (← links)
- On equitable and equitable list colorings of series-parallel graphs (Q534037) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← links)
- Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- \(k\)-forested coloring of planar graphs with large girth (Q632996) (← links)
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163) (← links)
- The linear arboricity of planar graphs with maximum degree at least five (Q648443) (← links)
- List edge and list total coloring of 1-planar graphs (Q692658) (← links)
- Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\) (Q708417) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree (Q726516) (← links)
- List injective coloring of planar graphs with girth \(g \geq 6\) (Q738861) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- (Q819820) (redirect page) (← links)
- The vertex linear arboricity of distance graphs (Q819822) (← links)
- On \(r\)-hued coloring of planar graphs with girth at least 6 (Q897613) (← links)
- On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces (Q998357) (← links)
- Total colorings of planar graphs without adjacent triangles (Q998509) (← links)
- Vertex arboricity of integer distance graph \(G(D_{m,k})\) (Q1024482) (← links)
- Planar graphs without 5-cycles or without 6-cycles (Q1025913) (← links)
- (Q1042910) (redirect page) (← links)
