The following pages link to Hong-Jian Lai (Q175486):
Displaying 50 items.
- Polynomially determine if a graph is \((s,3)\)-supereulerian (Q2231716) (← links)
- Matching and spanning trails in digraphs (Q2231788) (← links)
- On the chromatic numbers of signed triangular and hexagonal grids (Q2234782) (← links)
- Multigraphic degree sequences and Hamiltonian-connected line graphs (Q2240663) (← links)
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube (Q2242698) (← links)
- Note on edge-disjoint spanning trees and eigenvalues (Q2250921) (← links)
- Vertex-connectivity and eigenvalues of graphs (Q2272481) (← links)
- Obstructions to a binary matroid being graphic (Q2275474) (← links)
- On the sizes of bi-\(k\)-maximal graphs (Q2307504) (← links)
- Spanning tree packing number and eigenvalues of graphs with given girth (Q2321370) (← links)
- On \(s\)-Hamiltonian line graphs of claw-free graphs (Q2324489) (← links)
- Characterizations of matroids with an element lying in a restricted number of circuits (Q2331594) (← links)
- Generalized cospectral graphs with and without Hamiltonian cycles (Q2332465) (← links)
- On the permanental sum of graphs (Q2333188) (← links)
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs (Q2334065) (← links)
- The index problem of group connectivity (Q2364864) (← links)
- On group choosability of total graphs (Q2376095) (← links)
- Supereulerian width of dense graphs (Q2404391) (← links)
- Characterizations of \(k\)-cutwidth critical trees (Q2410043) (← links)
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank (Q2419031) (← links)
- On \(r\)-hued colorings of graphs without short induced paths (Q2421855) (← links)
- Hamiltonian connected hourglass free line graphs (Q2427529) (← links)
- Group connectivity and group colorings of graphs --- a survey (Q2430307) (← links)
- Spanning 3-connected index of graphs (Q2436658) (← links)
- Edge-disjoint spanning trees and eigenvalues (Q2442253) (← links)
- On the existence of super edge-connected graphs with prescribed degrees (Q2449175) (← links)
- On circular flows of graphs (Q2460626) (← links)
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors (Q2462341) (← links)
- An inequality for the group chromatic number of a graph (Q2462377) (← links)
- New sufficient condition for Hamiltonian graphs (Q2463936) (← links)
- On group chromatic number of graphs (Q2494108) (← links)
- Hamiltonicity in 3-connected claw-free graphs (Q2496201) (← links)
- Every 3-connected, essentially 11-connected line graph is Hamiltonian (Q2496206) (← links)
- Collapsible biclaw-free graphs (Q2501550) (← links)
- Conditional colorings of graphs (Q2501581) (← links)
- Genetic theory for cubic graphs (Q2517298) (← links)
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected (Q2519848) (← links)
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden (Q2629239) (← links)
- On spanning disjoint paths in line graphs (Q2637723) (← links)
- Supereulerian graphs with constraints on the matching number and minimum degree (Q2657064) (← links)
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs (Q2657065) (← links)
- Polynomially determining spanning connectivity of locally connected line graphs (Q2661222) (← links)
- Spectral gap of the largest eigenvalue of the normalized graph Laplacian (Q2674036) (← links)
- Super-Eulerian graphs and the Petersen graph. II (Q2715961) (← links)
- Spanning trails that join given edges in 3-edge-connected graphs. (Q2715995) (← links)
- Extremal size of graphs without a nowhere-zero 3-flow (Q2732635) (← links)
- Connectivity of cycle matroids and bicircular matroids (Q2761003) (← links)
- Supereulerian digraphs with large arc-strong connectivity (Q2800596) (← links)
- Integer flows and orientations (Q2822596) (← links)
- \(K_5^-\)-factor in a graph. (Q2823202) (← links)
