The following pages link to Xiangwen Li (Q221704):
Displaying 50 items.
- Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs (Q297939) (← links)
- Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity (Q335575) (← links)
- Group connectivity of bridged graphs (Q354436) (← links)
- Degree sum of 3 independent vertices and \(Z_3\)-connectivity (Q389473) (← links)
- Realizing degree sequences as \(Z_3\)-connected graphs (Q400414) (← links)
- Degree condition and \(Z_3\)-connectivity (Q418870) (← links)
- Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs (Q442306) (← links)
- Collapsible graphs and Hamilton cycles of line graphs (Q494432) (← links)
- Group chromatic number of Halin graphs (Q497348) (← links)
- Interval coloring of (3, 4)-biregular bigraphs having two (2,3)-biregular bipartite subgraphs (Q548414) (← links)
- Small cycle covers of 3-connected cubic graphs (Q615999) (← links)
- Degree sum condition for \(Z_{3}\)-connectivity in graphs (Q712268) (← links)
- Nowhere-zero 3-flows of claw-free graphs (Q740659) (← links)
- Maximum degree condition and group connectivity (Q742616) (← links)
- Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group (Q893326) (← links)
- \(Z_3\)-connectivity of wreath product of graphs (Q897239) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- Degree conditions for group connectivity (Q966042) (← links)
- Optimal radio labellings of complete \(m\)-ary trees (Q968168) (← links)
- A constructive characterization of total domination vertex critical graphs (Q1011745) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- Small cycle cover of 2-connected cubic graphs (Q1402087) (← links)
- Hamilton cycles in 1-tough triangle-free graphs (Q1613545) (← links)
- On strong edge-coloring of graphs with maximum degree 4 (Q1682888) (← links)
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501) (← links)
- Nowhere-zero flows on signed wheels and signed fans (Q1714012) (← links)
- Labeling outerplanar graphs with maximum degree three (Q1759878) (← links)
- Spanning trails connecting given edges (Q1777232) (← links)
- Group connectivity in 3-edge-connected graphs (Q1926023) (← links)
- Nowhere-zero \(3\)-flows in dihedral Cayley graphs (Q1944912) (← links)
- Spanning Eulerian subgraphs of 2-edge-connected graphs (Q1950407) (← links)
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
- Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable (Q2012890) (← links)
- The Chvátal-Erdős condition for group connectivity in graphs (Q2014729) (← links)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors (Q2094384) (← links)
- Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← links)
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)
- Strong edge-coloring of pseudo-Halin graphs (Q2302063) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Zero-sum 6-flows in 5-regular graphs (Q2317918) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- A relaxation of the Bordeaux conjecture (Q2349972) (← links)
- Group connectivity and matchings (Q2354611) (← links)
- Group connectivity in \(J_3\) line graphs (Q2354617) (← links)
- \(Z_3\)-connectivity of claw-free graphs (Q2361081) (← links)
- Group connectivity and group colorings of graphs --- a survey (Q2430307) (← links)
- An inequality for the group chromatic number of a graph (Q2462377) (← links)
