The following pages link to (Q4871748):
Displaying 41 items.
- Oriented Hamiltonian cycles in tournaments (Q1850481) (← links)
- A generalization of a theorem of Dirac (Q1850552) (← links)
- Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture (Q1850573) (← links)
- The complement of the path is determined by its spectrum (Q1855387) (← links)
- A divergence-like characterization of admissible functions on digraphs (Q1885481) (← links)
- On degree sum conditions for directed path-factors with a specified number of paths (Q2005702) (← links)
- Removable edges and chords of longest cycles in 3-connected graphs (Q2014727) (← links)
- Equality of graphs up to complementation (Q2023760) (← links)
- Partitioning transitive tournaments into isomorphic digraphs (Q2035088) (← links)
- A note on a spanning 3-tree (Q2149492) (← links)
- A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685) (← links)
- The order of hypotraceable oriented graphs (Q2275358) (← links)
- Equivalence of Jackson's and Thomassen's conjectures (Q2349510) (← links)
- Intersections of cycles in \(k\)-connected graphs (Q2354605) (← links)
- Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
- On prisms, Möbius ladders and the cycle space of dense graphs (Q2441654) (← links)
- Cycles and stability (Q2464153) (← links)
- On a cyclic connectivity property of directed graphs (Q2469976) (← links)
- Cycle double covers and spanning minors. I (Q2490249) (← links)
- Longest path partitions in generalizations of tournaments (Q2501556) (← links)
- Hypomorphy of graphs up to complementation (Q2519016) (← links)
- The numbers of shared upper bounds determine a poset (Q2572468) (← links)
- On colorful edge triples in edge-colored complete graphs (Q2657036) (← links)
- Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles (Q2689639) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- A bound on the chromatic number using the longest odd cycle length (Q3437002) (← links)
- A degree sum condition for longest cycles in 3-connected graphs (Q3437003) (← links)
- Hamilton cycles in strong products of graphs (Q4676590) (← links)
- On the number of edges of a graph and its complement (Q5009840) (← links)
- Regular Graphs with Few Longest Cycles (Q5067426) (← links)
- Dirac's Condition for Spanning Halin Subgraphs (Q5238744) (← links)
- On the Maximum Number of Spanning Copies of an Orientation in a Tournament (Q5366972) (← links)
- Robust Hamiltonicity of Dirac graphs (Q5420107) (← links)
- Cycle lengths in graphs with large minimum degree (Q5471013) (← links)
- Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
- Long paths and cycles passing through specified vertices under the average degree condition (Q5964991) (← links)
- Ádám's conjecture (Q6038575) (← links)
- Path decompositions of tournaments (Q6075058) (← links)
- Bonds Intersecting Long Paths in \(k\) -Connected Graphs (Q6098461) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)
- Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs (Q6646426) (← links)
