The following pages link to Hong-Jian Lai (Q175486):
Displaying 50 items.
- Hamiltonian-connected graphs (Q945175) (← links)
- Nowhere-zero 3-flows in triangularly connected graphs (Q958692) (← links)
- On (s,t)-supereulerian graphs in locally highly connected graphs (Q965976) (← links)
- Degree conditions for group connectivity (Q966042) (← links)
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index (Q982614) (← links)
- An \(s\)-Hamiltonian line graph problem (Q995763) (← links)
- Degree sequence and supereulerian graphs (Q998406) (← links)
- Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected (Q1003612) (← links)
- Transforming a graph into a 1-balanced graph (Q1003673) (← links)
- On mod \((2p+1)\)-orientations of graphs (Q1003841) (← links)
- Edge-connectivity and edge-disjoint spanning trees (Q1011773) (← links)
- Random walks for selected Boolean implication and equivalence problems (Q1014275) (← links)
- On group connectivity of graphs (Q1015425) (← links)
- Hamiltonian connectedness in 3-connected line graphs (Q1028425) (← links)
- The supereulerian graphs in the graph family \(C(l,k)\) (Q1043654) (← links)
- Hamilton-connected indices of graphs (Q1044954) (← links)
- On the Hamiltonian index (Q1099188) (← links)
- Graphs without spanning closed trails (Q1126285) (← links)
- Graph whose edges are in small cycles (Q1182734) (← links)
- Duality in graph families (Q1208357) (← links)
- Nowhere-zero 3-flows of highly connected graphs (Q1208358) (← links)
- Fractional arboricity, strength, and principal partitions in graphs and matroids (Q1208447) (← links)
- Small circuit double covers of cubic multigraphs (Q1322014) (← links)
- Every 4-connected line graph of a planar graph is Hamiltonian (Q1340124) (← links)
- Group chromatic number of graphs without \(K_5\)-minors (Q1348659) (← links)
- Eulerian subgraphs containing given vertices and hamiltonian line graphs (Q1377854) (← links)
- Small cycle cover of 2-connected cubic graphs (Q1402087) (← links)
- Group connectivity of 3-edge-connected chordal graphs (Q1576573) (← links)
- Packing spanning trees in highly essentially connected graphs (Q1618210) (← links)
- Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs (Q1625789) (← links)
- Modulo orientations with bounded independence number (Q1671302) (← links)
- A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs (Q1685990) (← links)
- Connectivity keeping stars or double-stars in 2-connected graphs (Q1699561) (← links)
- \(r\)-hued coloring of sparse graphs (Q1701096) (← links)
- Locally dense supereulerian digraphs (Q1701108) (← links)
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees (Q1709519) (← links)
- Degree sum and Hamiltonian-connected line graphs (Q1709539) (← links)
- Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-free graphs (Q1733851) (← links)
- Modulo 5-orientations and degree sequences (Q1741509) (← links)
- The connectivity of generalized graph products (Q1751415) (← links)
- Upper bounds of \(r\)-hued colorings of planar graphs (Q1752467) (← links)
- Constructing graphs which are permanental cospectral and adjacency cospectral (Q1756130) (← links)
- Group colorability of multigraphs (Q1759814) (← links)
- Eulerian subgraphs and Hamilton-connected line graphs (Q1765520) (← links)
- Spanning trails connecting given edges (Q1777232) (← links)
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs (Q1786882) (← links)
- Line graphs and forbidden induced subgraphs (Q1850532) (← links)
- Cycle cover ratio of regular matroids (Q1864612) (← links)
- Vertex arboricity and maximum degree (Q1894756) (← links)
- Large survivable nets and the generalized prisms (Q1897364) (← links)
