The following pages link to Guizhen Liu (Q353623):
Displaying 50 items.
- (Q189765) (redirect page) (← links)
- (Q1375822) (redirect page) (← links)
- On edge colorings of 1-toroidal graphs (Q353624) (← links)
- Group edge choosability of planar graphs without adjacent short cycles (Q381084) (← links)
- Properties of Hamilton cycles of circuit graphs of matroids (Q382146) (← links)
- Total coloring of embedded graphs with maximum degree at least seven (Q391777) (← 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)
- Improved bounds for acyclic chromatic index of planar graphs (Q534360) (← links)
- On \(f\)-edge cover coloring of nearly bipartite graphs (Q538024) (← links)
- Paths and cycles in matroid base graphs (Q583218) (← links)
- Vertex-distinguishing edge colorings of graphs with degree sum conditions (Q607682) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← links)
- Neighbor set for the existence of \((g,f,n)\)-critical graphs (Q624870) (← links)
- A note on \([r, s, c, t]\)-colorings of graphs (Q624890) (← links)
- Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- The existence of even regular factors of regular graphs on the number of cut edges (Q627564) (← 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)
- Edge covering coloring and fractional edge covering coloring (Q698408) (← links)
- Degree conditions of fractional ID-\(k\)-factor-critical graphs (Q708448) (← links)
- A simple existence criterion for \((g<f)\)-factors (Q757439) (← links)
- Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties (Q763635) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- Some sufficient conditions for a graph to be of \(C_f\) 1 (Q812743) (← links)
- Circular list colorings of some graphs (Q815980) (← links)
- Edge covering coloring of nearly bipartite graphs (Q854458) (← links)
- Minimal regular 2-graphs and applications (Q854642) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- Paths in circuit graphs of matroids (Q924155) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- \(f\)-colorings of some graphs of \(f\)-class 1 (Q943513) (← links)
- \(k\) -factors in regular graphs (Q943560) (← links)
- Characterizations of maximum fractional \((g,f)\)-factors of graphs (Q947113) (← links)
- A special \(f\)-edge cover-coloring of multigraphs (Q949274) (← links)
- Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph (Q949291) (← links)
- A note on the \((g, f)\)-coloring (Q949352) (← links)
- Fault-tolerant embedding of paths in crossed cubes (Q954985) (← links)
- The super connectivity of augmented cubes (Q963333) (← links)
- List edge and list total colorings of planar graphs without short cycles (Q975488) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- A note on ``The super connectivity of augmented cubes'' (Q987832) (← links)
- Path embedding in faulty hypercubes (Q990515) (← links)
- The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
- Edge covered critical multigraphs (Q998374) (← links)
- A note on the edge cover chromatic index of multigraphs (Q998396) (← links)
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (Q998494) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
