Forbidden pairs for traceability of 2-connected graphs
From MaRDI portal
Cites work
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
- A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
- A pair of forbidden subgraphs and perfect matchings.
- Characterizing forbidden pairs for hamiltonian properties
- Characterizing forbidden pairs for relative length of longest paths and cycles
- Claw-free 3-connectedP11-free graphs are hamiltonian
- Closure and stable Hamiltonian properties in claw-free graphs
- Dominating cycles and forbidden pairs containing \(P_5\)
- Eulerian subgraphs and Hamilton-connected line graphs
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
- Forbidden pairs and the existence of a dominating cycle
- Forbidden pairs for \(k\)-connected Hamiltonian graphs
- Forbidden pairs for spanning (closed) trails
- Forbidden subgraph pairs for traceability of block-chains
- Forbidden subgraphs and the existence of a 2-factor
- Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
- Forbidden subgraphs that imply 2-factors
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Graph theory
- Hamilton cycles in 3-connected claw-free and net-free graphs
- Hamiltonian results inK1,3-free graphs
- Hamilton‐connected {claw,net}‐free graphs, II
- Hamilton‐connected {claw, bull}‐free graphs
- Hamilton‐connected {claw, net}‐free graphs, I
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- Nonempty intersection of longest paths in graphs without forbidden pairs
- On a closure concept in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On forbidden pairs implying Hamilton-connectedness
- Pairs of forbidden induced subgraphs for homogeneously traceable graphs
- Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
- Pancyclicity of 4-connected \{claw, generalized bull\}-free graphs
- Pancyclicity of 4-connected, claw-free, \(P_{10}\)-free graphs
- Spanning trails in a 2-connected graph
- The local structure of claw-free graphs without induced generalized bulls
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
This page was built for publication: Forbidden pairs for traceability of 2-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925708)
