Pages that link to "Item:Q1175978"
From MaRDI portal
The following pages link to Hamiltonism, degree sum and neighborhood intersections (Q1175978):
Displayed 27 items.
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- Spanning trees: A survey (Q659663) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- Four sufficient conditions for hamiltonian graphs (Q803156) (← links)
- Algorithms for long paths in graphs (Q884457) (← links)
- On covering vertices of a graph by trees (Q941380) (← links)
- The \(k\)-dominating cycles in graphs (Q966170) (← links)
- Algorithm for two disjoint long paths in 2-connected graphs (Q986559) (← links)
- A look at cycles containing specified elements of a graph (Q1045026) (← links)
- Hamiltonism, degree sum and neighborhood intersections (Q1175978) (← links)
- Hamiltonian properties of graphs with large neighborhood unions (Q1182981) (← links)
- Long cycles, degree sums and neighborhood unions (Q1309446) (← links)
- Hamiltonian paths and hamiltonian connectivity in graphs (Q1309475) (← links)
- A closure concept based on neighborhood unions of independent triples (Q1313822) (← links)
- Neighborhood unions and Hamiltonian properties (Q1336717) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Longest cycles in 3-connected graphs (Q1363662) (← links)
- Graphs with large maximum degree containing no odd cycles of a given length (Q1405126) (← links)
- The total chromatic number of graphs of even order and high degree (Q1408886) (← links)
- Global insertion and Hamiltonicity in DCT-graphs (Q1584209) (← links)
- A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs (Q1896341) (← links)
- Longest cycles in 4-connected graphs (Q2404386) (← links)
- Hamiltonian cycles in 1-tough graphs (Q2563428) (← links)
- A condition ensuring that a connected graph has a spanning tree with few leaves (Q2699565) (← links)
- Updating the hamiltonian problem—A survey (Q3978362) (← links)
- On \((2, k)\)-Hamilton-connected graphs (Q6140253) (← links)