The following pages link to Hao Li (Q186102):
Displaying 50 items.
- (Q230790) (redirect page) (← links)
- Universal arcs in tournaments (Q284728) (← links)
- Cyclable sets of vertices in 3-connected graphs (Q286770) (← links)
- An implicit degree condition for relative length of long paths and cycles in graphs (Q287873) (← links)
- A note on edge-disjoint Hamilton cycles in line graphs (Q295256) (← links)
- Locating sets of vertices on Hamiltonian cycles (Q298964) (← links)
- Vertex-distinguishing proper arc colorings of digraphs (Q298989) (← links)
- Hamiltonian cycles in spanning subgraphs of line graphs (Q298990) (← links)
- (Q353577) (redirect page) (← links)
- The degree distribution of the random multigraphs (Q353578) (← links)
- An implicit degree condition for pancyclicity of graphs (Q367090) (← links)
- An implicit degree Ore-condition for pancyclicity of graphs (Q383626) (← links)
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs (Q383748) (← links)
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- \(Z_3\)-connectivity in abelian Cayley graphs (Q389989) (← links)
- Total chromatic number of generalized Mycielski graphs (Q396736) (← links)
- (Q400393) (redirect page) (← links)
- Complementary cycles in regular bipartite tournaments (Q400394) (← links)
- An implicit degree condition for Hamiltonian graphs (Q432725) (← links)
- A note on collapsible graphs and super-Eulerian graphs (Q442301) (← links)
- Endpoint extendable paths in dense graphs (Q442374) (← links)
- Locating pairs of vertices on Hamiltonian cycles (Q442398) (← links)
- Collapsible graphs and Hamiltonian connectedness of line graphs (Q444449) (← links)
- Color degree and heterochromatic cycles in edge-colored graphs (Q449221) (← links)
- An implicit weighted degree condition for heavy cycles (Q472135) (← links)
- (Q505461) (redirect page) (← links)
- A note on neighbor expanded sum distinguishing index (Q505462) (← links)
- Panconnected index of graphs (Q512606) (← links)
- The maximum and minimum degree of the random \(r\)-uniform \(r\)-partite hypergraphs (Q519211) (← links)
- (Q587972) (redirect page) (← links)
- A new class of Ramsey-Turán problems (Q607020) (← links)
- Group connectivity in line graphs (Q641209) (← links)
- The maximum and minimum degrees of random bipartite multigraphs (Q655893) (← links)
- On 3-edge-connected supereulerian graphs (Q659686) (← links)
- Packings and perfect path double covers of maximal planar graphs (Q686163) (← links)
- On Hamiltonian claw-free graphs (Q686468) (← links)
- Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs (Q709323) (← links)
- On reliability of the folded hypercubes in terms of the extra edge-connectivity (Q726366) (← links)
- A new sufficient condition for pancyclability of graphs (Q741733) (← links)
- Collapsible graphs and Hamiltonicity of line graphs (Q742590) (← links)
- On the maximal cliques of the quadratic forms graph in even characteristic (Q753831) (← links)
- Graphs with odd cocliques (Q753839) (← links)
- Locating any two vertices on Hamiltonian cycles in large graphs (Q776260) (← links)
- Lower and upper orientable strong diameters of graphs satisfying the Ore condition (Q845616) (← links)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
- A sufficient condition for cyclability in directed graphs (Q878617) (← links)
- Partition of a graph into cycles and vertices (Q878638) (← links)
- A Chvátal--Erdős type condition for pancyclability (Q878642) (← links)
- Algorithms for long paths in graphs (Q884457) (← links)
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs (Q906435) (← links)
