Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
From MaRDI portal
(Redirected from Publication:536646)
Recommendations
Cites work
- scientific article; zbMATH DE number 426167 (Why is no real title available?)
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- scientific article; zbMATH DE number 4108816 (Why is no real title available?)
- scientific article; zbMATH DE number 3273016 (Why is no real title available?)
- scientific article; zbMATH DE number 3321024 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A Theorem on Planar Graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- An Improved Exact Algorithm for Cubic Graph TSP
- Approximating the Longest Cycle Problem in Sparse Graphs
- Circumference of Graphs with Bounded Degree
- Color-coding
- Computing Sharp 2-Factors in Claw-Free Graphs
- Computing and Combinatorics
- Constrained Edge-Splitting Problems
- Cycles through given vertices and closures
- Cycles through ten vertices in 3-connected cubic graphs
- Dynamic programming meets the principle of inclusion and exclusion
- Edge-splittings preserving local edge-connectivity of graphs
- Exact algorithms for finding longest cycles in claw-free graphs
- Finding Paths and Cycles of Superpolylogarithmic Length
- Finding large cycles in Hamiltonian graphs
- Hamiltonian results inK1,3-free graphs
- Inclusion and exclusion algorithm for the Hamiltonian path problem
- Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs
- Long cycles in 3-connected graphs
- Long cycles in 3‐connected graphs in orientable surfaces
- Long paths and cycles in tough graphs
- Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
- Longest Cycles in 3-Connected 3-Regular Graphs
- Longest Simple Paths in Polyhedral Graphs
- Longest cycles in 3-connected cubic graphs
- On Hamiltonian Circuits
- On Linear Time Minor Tests with Depth-First Search
- On a closure concept in claw-free graphs
- On a theorem of Mader
- On approximating the longest path in a graph
- On hamiltonian line graphs and connectivity
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
- Reflections on graph theory
- Removable edges in cyclically 4-edge-connected cubic graphs
- Shortness exponents of families of graphs
- Simple paths on polyhedra
- The Traveling Salesman Problem for Cubic Graphs
- The Travelling Salesman Problem in Bounded Degree Graphs
- The \(*\)-closure for graphs and claw-free graphs
- Trees in Polyhedral Graphs
Cited in
(11)- Circumference of 3-connected cubic graphs
- A twelve vertex theorem for 3-connected claw-free graphs
- Edge decomposition of connected claw-free cubic graphs
- On the circumference of 3-connected cubic triangle-free plane graphs
- Balanced generic circuits without long paths
- Circumferences of 2-factors in claw-free graphs
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Dual circumference and collinear sets
- Dual circumference and collinear sets
- Cubic graphs with large circumference deficit
- On 2-factors with long cycles in 3-connected claw-free graphs
This page was built for publication: Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536646)
