The following pages link to Ying Qian Wang (Q977285):
Displaying 31 items.
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- On acyclic edge coloring of planar graphs without intersecting triangles (Q409363) (← links)
- Linear coloring of sparse graphs (Q412383) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
- Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
- On 3-choosability of triangle-free plane graphs (Q657261) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← links)
- Optimization problems of the third edge-connectivity of graphs (Q862723) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
- Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable (Q932660) (← links)
- On the diameter of generalized Kneser graphs (Q941359) (← links)
- A relaxation of Havel's 3-color problem (Q963412) (← links)
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320) (← links)
- On 3-colorability of planar graphs without adjacent short cycles (Q977289) (← links)
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
- Total colorings of planar graphs with maximum degree at least 8 (Q1043002) (← links)
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles (Q1043815) (← links)
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- Acyclic edge coloring of sparse graphs (Q1759399) (← links)
- A sufficient condition for a plane graph with maximum degree 6 to be class 1 (Q1759890) (← links)
- Super restricted edge-connectivity of vertex-transitive graphs (Q1763355) (← links)
