The following pages link to Xin Zhang (Q266018):
Displaying 50 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- Equitable vertex arboricity of subcubic graphs (Q267194) (← links)
- (Q328708) (redirect page) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- On edge colorings of 1-toroidal graphs (Q353624) (← links)
- Group edge choosability of planar graphs without adjacent short cycles (Q381084) (← links)
- List total coloring of pseudo-outerplanar graphs (Q393451) (← links)
- Equitable vertex arboricity of graphs (Q394205) (← links)
- (Q401156) (redirect page) (← links)
- On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs (Q401157) (← links)
- On edge colorings of 1-planar graphs without adjacent triangles (Q413262) (← links)
- On \(r\)-acyclic edge colorings of planar graphs (Q442224) (← links)
- Edge covering pseudo-outerplanar graphs with forests (Q449118) (← links)
- Equitable coloring and equitable choosability of planar graphs without 5- and 7-cycles (Q454578) (← links)
- Equitable colorings of Cartesian products with balanced complete multipartite graphs (Q476328) (← links)
- (Q477903) (redirect page) (← links)
- Drawing complete multipartite graphs on the plane with restrictions on crossings (Q477904) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- Equitable vertex arboricity of planar graphs (Q514833) (← links)
- On equitable and equitable list colorings of series-parallel graphs (Q534037) (← links)
- \(k\)-forested coloring of planar graphs with large girth (Q632996) (← links)
- On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← 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)
- On equitable colorings of sparse graphs (Q726517) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- The edge chromatic number of outer-1-planar graphs (Q906489) (← links)
- Equitable coloring and equitable choosability of graphs with small maximum average degree (Q1649917) (← links)
- Total coloring of outer-1-planar graphs with near-independent crossings (Q1680477) (← links)
- Light paths and edges in families of outer-1-planar graphs (Q1751428) (← links)
- Equitable coloring of three classes of 1-planar graphs (Q1753367) (← links)
- Light subgraphs in the family of 1-planar graphs with high minimum degree (Q1757981) (← links)
- The structure of plane graphs with independent crossings and its applications to coloring problems (Q1935605) (← links)
- On edge colorings of \(1\)-planar graphs (Q1944052) (← links)
- A note on relaxed equitable coloring of graphs (Q1944202) (← links)
- A structure of 1-planar graph and its applications to coloring problems (Q2000562) (← links)
- Upper bound on the sum of powers of the degrees of graphs with few crossings per edge (Q2009245) (← links)
- Equitable partition of planar graphs (Q2022132) (← links)
- List edge coloring of outer-1-planar graphs (Q2023746) (← links)
- Theoretical aspects of equitable partition of networks into sparse modules (Q2031046) (← links)
- Linear arboricity of outer-1-planar graphs (Q2033994) (← links)
- Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
- Total coloring of outer-1-planar graphs: the cold case (Q2039699) (← links)
- Incidence coloring of mycielskians with fast algorithm (Q2043007) (← links)
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy (Q2072075) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs (Q2220774) (← links)
- Equitable list tree-coloring of bounded treewidth graphs (Q2220879) (← links)
- On \((p, 1)\)-total labelling of some 1-planar graphs (Q2227112) (← links)
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy (Q2230570) (← links)
