The following pages link to Gexin Yu (Q393459):
Displaying 50 items.
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← links)
- An extremal problem on group connectivity of graphs (Q427794) (← links)
- Strong edge-colorings for \(k\)-degenerate graphs (Q497384) (← links)
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs (Q512620) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
- Extremal permutations in routing cycles (Q727043) (← links)
- Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture (Q744154) (← links)
- Equitable defective coloring of sparse planar graphs (Q764883) (← links)
- Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity (Q817746) (← links)
- On extremal matrices of second largest exponent by Boolean rank (Q869927) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- Decomposing a planar graph with girth 9 into a forest and a matching (Q925026) (← links)
- Ore-condition and \(Z_3\)-connectivity (Q942129) (← links)
- Minimum degree conditions for \(H\)-linked graphs (Q947099) (← links)
- Packing of graphs with small product of sizes (Q958696) (← links)
- On a graph packing conjecture by Bollobás, Eldridge and Catlin (Q987545) (← links)
- Hamiltonian connectedness in 3-connected line graphs (Q1028425) (← links)
- Ore-type conditions implying 2-factors consisting of short cycles (Q1044946) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- Strong edge-coloring for planar graphs with large girth (Q1625788) (← links)
- Strong chromatic index of graphs with maximum degree four (Q1671652) (← links)
- A note on chromatic number and induced odd cycles (Q1676794) (← links)
- On strong edge-coloring of graphs with maximum degree 4 (Q1682888) (← links)
- Strong list-chromatic index of subcubic graphs (Q1800415) (← links)
- Graphs containing every 2-factor (Q1926028) (← links)
- An improved linear connectivity bound for tournaments to be highly linked (Q1979428) (← links)
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) (Q2000564) (← links)
- Maximum average degree and relaxed coloring (Q2012543) (← links)
- Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable (Q2012890) (← links)
- Open locating-dominating sets in circulant graphs (Q2062672) (← links)
- Note on injective edge-coloring of graphs (Q2074357) (← links)
- Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers (Q2075527) (← links)
- Spanning tree packing and 2-essential edge-connectivity (Q2092353) (← links)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs (Q2192116) (← links)
- Disjoint chorded cycles in graphs with high Ore-degree (Q2232037) (← links)
- Linear choosability of sparse graphs (Q2275448) (← links)
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)
- The strong edge-coloring for graphs with small edge weight (Q2297732) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- DP-4-colorability of two classes of planar graphs (Q2324485) (← links)
- Minimum degree condition for a graph to be knitted (Q2324511) (← links)
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable (Q2329168) (← links)
- A relaxation of the Bordeaux conjecture (Q2349972) (← links)
- Optimal open-locating-dominating sets in infinite triangular grids (Q2354721) (← links)
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid (Q2380272) (← links)
