Pages that link to "Item:Q4182545"

The following pages link to On Maximal Circuits in Finite Graphs (Q4182545):

Displaying 40 items.

• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
• Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
• Graph invariants and large cycles: a survey (Q539347) (← links)
• Long cycles in graphs with large degree sums (Q749553) (← links)
• Berge cycles in non-uniform hypergraphs (Q783055) (← links)
• An Ore-type condition for the existence of two disjoint cycles (Q783683) (← links)
• \(k\)-factors and Hamilton cycles in graphs (Q884893) (← links)
• Recognizing tough graphs is NP-hard (Q918697) (← links)
• A simple proof of a theorem of Jung (Q918991) (← links)
• The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803) (← links)
• On path-coverings and Hamilton-connectivity of finite graphs (Q1148335) (← links)
• A sufficient condition for a graph to be Hamiltonian (Q1152383) (← links)
• Maximale Kreise in Graphen (Q1156816) (← links)
• Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\) (Q1169481) (← links)
• Hamiltonian properties of graphs with large neighborhood unions (Q1182981) (← links)
• Maximum nonhamiltonian tough graphs (Q1185081) (← links)
• Über Hamiltonsche Kreise und unabhängige Ecken in Graphen (Q1253262) (← links)
• Long cycles, degree sums and neighborhood unions (Q1309446) (← links)
• All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions (Q1309456) (← links)
• 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
• Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
• On one extension of Dirac's theorem on Hamiltonicity (Q1630770) (← links)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
• Toughness, degrees and 2-factors (Q1887644) (← links)
• Long cycles in graphs with prescribed toughness and minimum degree (Q1894753) (← links)
• Hamiltonian degree conditions for tough graphs (Q1896350) (← links)
• A note on dominating cycles in 2-connected graphs (Q1923475) (← links)
• A vulnerability parameter of networks (Q2037692) (← links)
• An Ore-type condition for Hamiltonicity in tough graphs (Q2073293) (← links)
• Toughness in graphs -- a survey (Q2494126) (← links)
• New local conditions for a graph to be Hamiltonian (Q2502032) (← links)
• Hamiltonian cycles in 1-tough graphs (Q2563428) (← links)
• Some local-global phenomena in locally finite graphs (Q2659174) (← links)
• A Remark on Hamiltonian Cycles (Q4024478) (← links)
• Hamiltonian cycles in <i>n</i>‐extendable graphs (Q4539871) (← links)
• The vertex attack tolerance of complex networks (Q4578160) (← links)
• ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS (Q5370790) (← links)
• (Q5708558) (← links)
• On agglomeration-based rupture degree in networks and a heuristic algorithm (Q6050471) (← links)
• A closure lemma for tough graphs and Hamiltonian degree conditions (Q6197740) (← links)