Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
From MaRDI portal
Publication:536646
DOI10.1016/j.jctb.2011.02.009zbMath1226.05141OpenAlexW1988255869MaRDI QIDQ536646
Mark Bilinski, Jie Ma, Bill Jackson, Xingxing Yu
Publication date: 19 May 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.02.009
claw-free graphEulerian subgraphcubic graphline graphcircumferenceedge-splittingcyclabilityRyjáček closure
Related Items (10)
A twelve vertex theorem for 3-connected claw-free graphs ⋮ Cubic Graphs with Large Circumference Deficit ⋮ On the circumference of 3-connected cubic triangle-free plane graphs ⋮ Circumferences of 2-factors in claw-free graphs ⋮ Circumference of 3-connected cubic graphs ⋮ Dual circumference and collinear sets ⋮ Balanced generic circuits without long paths ⋮ Unnamed Item ⋮ Turing kernelization for finding long paths and cycles in restricted graph classes ⋮ Edge decomposition of connected claw-free cubic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On approximating the longest path in a graph
- Inclusion and exclusion algorithm for the Hamiltonian path problem
- On hamiltonian line graphs and connectivity
- Finding large cycles in Hamiltonian graphs
- The \(*\)-closure for graphs and claw-free graphs
- Longest cycles in 3-connected cubic graphs
- Removable edges in cyclically 4-edge-connected cubic graphs
- Dynamic programming meets the principle of inclusion and exclusion
- On a theorem of Mader
- On a closure concept in claw-free graphs
- Cycles through given vertices and closures
- Long cycles in 3-connected graphs
- Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs
- Exact algorithms for finding longest cycles in claw-free graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Cycles through ten vertices in 3-connected cubic graphs
- Long paths and cycles in tough graphs
- Edge-splittings preserving local edge-connectivity of graphs
- Shortness exponents of families of graphs
- Simple paths on polyhedra
- Approximating the Longest Cycle Problem in Sparse Graphs
- A Theorem on Planar Graphs
- A Dynamic Programming Approach to Sequencing Problems
- Longest Simple Paths in Polyhedral Graphs
- Hamiltonian results inK1,3-free graphs
- The Travelling Salesman Problem in Bounded Degree Graphs
- Computing Sharp 2-Factors in Claw-Free Graphs
- An Improved Exact Algorithm for Cubic Graph TSP
- Longest Cycles in 3-Connected 3-Regular Graphs
- On Linear Time Minor Tests with Depth-First Search
- Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
- Color-coding
- Constrained Edge-Splitting Problems
- Circumference of Graphs with Bounded Degree
- Reflections on graph theory
- Long cycles in 3‐connected graphs in orientable surfaces
- The Traveling Salesman Problem for Cubic Graphs
- Finding Paths and Cycles of Superpolylogarithmic Length
- Trees in Polyhedral Graphs
- Computing and Combinatorics
- On Hamiltonian Circuits
This page was built for publication: Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
