The following pages link to Hong-Jian Lai (Q175486):
Displaying 50 items.
- Hamiltonian-connected graphs with large neighborhoods and degrees (Q263937) (← links)
- Element deletion changes in dynamic coloring of graphs (Q271647) (← links)
- Dicycle cover of Hamiltonian oriented graphs (Q275871) (← links)
- Ore-type degree condition of supereulerian digraphs (Q284720) (← links)
- Extendability of contractible configurations for nowhere-zero flows and modulo orientations (Q293640) (← links)
- On the lower bound of \(k\)-maximal digraphs (Q294549) (← links)
- Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
- Fractional spanning tree packing, forest covering and eigenvalues (Q313822) (← links)
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs (Q345079) (← links)
- On extremal \(k\)-supereulerian graphs (Q383349) (← links)
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs (Q389497) (← links)
- On \(r\)-hued coloring of \(K_4\)-minor free graphs (Q393165) (← links)
- Realizing degree sequences as \(Z_3\)-connected graphs (Q400414) (← links)
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs (Q400521) (← links)
- Degree condition and \(Z_3\)-connectivity (Q418870) (← links)
- On dynamic coloring for planar graphs and graphs of higher genus (Q423914) (← links)
- On 3-connected Hamiltonian line graphs (Q427827) (← links)
- A dual version of the brooks group coloring theorem (Q442317) (← links)
- Collapsible graphs and Hamiltonian connectedness of line graphs (Q444449) (← links)
- Spanning cycles in regular matroids without small cocircuits (Q449202) (← links)
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees (Q452949) (← links)
- Augmenting and preserving partition connectivity of a hypergraph (Q482272) (← links)
- Characterizations of strength extremal graphs (Q489310) (← links)
- Panconnected index of graphs (Q512606) (← links)
- Regular graphs. A spectral approach (Q522553) (← links)
- Balanced and 1-balanced graph constructions (Q608258) (← links)
- Supereulerian graphs in the graph family \(C_{2}(6,k)\) (Q628342) (← links)
- Group connectivity in line graphs (Q641209) (← links)
- Degree sequences and graphs with disjoint spanning trees (Q642969) (← links)
- Supereulerian graphs and matchings (Q654204) (← links)
- \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs (Q658001) (← links)
- On 3-edge-connected supereulerian graphs (Q659686) (← links)
- (Q702621) (redirect page) (← links)
- Global asymptotic stability in a rational recursive sequence (Q702622) (← links)
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\) (Q708409) (← links)
- Degree sum condition for \(Z_{3}\)-connectivity in graphs (Q712268) (← links)
- Hamiltonicity of 3-connected line graphs (Q712614) (← links)
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid (Q714036) (← links)
- Collapsible graphs and Hamiltonicity of line graphs (Q742590) (← links)
- Spanning subgraph with Eulerian components (Q764890) (← links)
- Group connectivity of graphs with diameter at most 2 (Q820087) (← links)
- Generalized honeycomb torus is Hamiltonian (Q834887) (← links)
- Quadrangularly connected claw-free graphs (Q870987) (← links)
- Graphs with a 3-cycle-2-cover (Q897268) (← links)
- On \(r\)-hued coloring of planar graphs with girth at least 6 (Q897613) (← links)
- On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs (Q898149) (← links)
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs (Q906435) (← links)
- Unique graph homomorphisms onto odd cycles. II (Q919003) (← links)
- On \(s\)-Hamiltonian-connected line graphs (Q941364) (← links)
- The \(s\)-Hamiltonian index (Q942110) (← links)
