Characterizing forbidden pairs for hamiltonian properties
From MaRDI portal
(Redirected from Publication:1367026)
Recommendations
Cites work
- scientific article; zbMATH DE number 4191710 (Why is no real title available?)
- scientific article; zbMATH DE number 1185308 (Why is no real title available?)
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- scientific article; zbMATH DE number 42739 (Why is no real title available?)
- Extending cycles in graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Hamiltonicity in claw-free graphs
Cited in
(93)- Forbidden triples for perfect matchings
- 2-Trees: Structural insights and the study of Hamiltonian paths
- Forbidden induced subgraphs for star-free graphs
- Chorded pancyclic properties in claw-free graphs
- Results and problems on chorded cycles: a survey
- Heavy subgraphs, stability and Hamiltonicity
- Closure and forbidden pairs for 2-factors
- Heavy subgraph pairs for traceability of block-chains
- The local structure of claw-free graphs without induced generalized bulls
- Recent advances on the Hamiltonian problem: survey III
- Forbidden subgraphs for supereulerian and Hamiltonian graphs
- Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
- Forbidden pairs for equality of connectivity and edge-connectivity of graphs
- Forbidden pairs and the existence of a dominating cycle
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- Forbidden triples and traceability: A characterization
- Hamilton circuits and essential girth of claw free graphs
- Forbidden pairs of disconnected graphs implying Hamiltonicity
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs
- Forbidden quadruplets generating a finite set of 2-connected graphs
- Cycles through all finite vertex sets in infinite graphs
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs
- Forbidden subgraphs generating almost the same sets
- Characterizing forbidden pairs for relative length of longest paths and cycles
- Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions
- Nowhere-zero 3-flows and Z₃-connectivity of graphs without two forbidden subgraphs
- Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
- Nonempty intersection of longest paths in graphs without forbidden pairs
- Conditions for graphs to be path partition optimal
- Forbidden subgraphs and weak locally connected graphs
- Traceability in graphs with forbidden triples of subgraphs
- Forbidden subgraphs for graphs with (near) perfect matching to be Hamiltonian
- A pair of forbidden subgraphs and perfect matchings.
- Pairs of forbidden induced subgraphs for homogeneously traceable graphs
- Hamilton‐connected {claw, bull}‐free graphs
- Hamilton‐connected {claw, net}‐free graphs, I
- Forbidden subgraphs for existences of (connected) 2-factors of a graph
- Forbidden subgraphs and the existence of spanning k-trees
- A forbidden pair for connected graphs to have spanning k‐trees
- Clique-heavy subgraphs and pancyclicity of 2-connected graphs
- Forbidden pairs and \((k,m)\)-pancyclicity
- Fan's condition on induced subgraphs for circumference and pancyclicity
- A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs
- Forbidden subgraphs and the existence of a 2-factor
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs
- Toughness, forbidden subgraphs and pancyclicity
- Stability of hereditary graph classes under closure operations
- scientific article; zbMATH DE number 810052 (Why is no real title available?)
- Characterizing forbidden pairs for Hamiltonian squares
- Claw-free and N(2,1,0)-free graphs are almost net-free
- Forbidden subgraphs for Hamiltonicity of 1-tough graphs
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
- Forbidden pairs of disconnected graphs for 2‐factor of connected graphs
- Forbidden pairs of disconnected graphs for supereulerianity of connected graphs
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Forbidden pairs for \(k\)-connected Hamiltonian graphs
- Forbidden subgraphs for chorded pancyclicity
- Dominating cycles and forbidden pairs containing \(P_5\)
- Hamiltonian type properties in claw-free \(P_5\)-free graphs
- Line graphs and forbidden induced subgraphs
- Pancyclic type properties of claw-free \(P_6\)-free graphs
- Forbidden subgraphs on Hamiltonian index
- Closure and forbidden pairs for Hamiltonicity
- Characterization of forbidden subgraphs for the existence of even factors in a graph
- Forbidden pairs and the existence of a spanning Halin subgraph
- Disconnected forbidden pairs force supereulerian graphs to be Hamiltonian
- Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected
- Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs
- Ramsey-type results for path covers and path partitions. II: Digraphs
- On forbidden pairs implying Hamilton-connectedness
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Forbidden subgraphs that imply 2-factors
- Non-empty intersection of longest paths in \(H\)-free graphs
- Forbidden pairs of disconnected graphs for traceability in connected graphs
- Forbidden pairs for spanning (closed) trails
- On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs
- Forbidden subgraphs generating a finite set
- Implementation of RTO in a large hydrogen network considering uncertainty
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
- Disconnected forbidden subgraphs, toughness and Hamilton cycles
- Hamiltonian extendable graphs
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
- Critical graphs for subpancyclicity of 3-connected claw-free graphs
- On traceability of claw-\({o_{-1}}\)-heavy graphs
- Ramsey-type results for path covers and path partitions
- A pair of forbidden subgraphs and 2-factors
- Forbidden subgraphs and the existence of a spanning tree without small degree stems
- Forbidden pairs with a common graph generating almost the same sets
This page was built for publication: Characterizing forbidden pairs for hamiltonian properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367026)
