Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable edges in cyclically 4-edge-connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion and exclusion algorithm for the Hamiltonian path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman Problem in Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Time Minor Tests with Depth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Cycles in 3-Connected 3-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for finding longest cycles in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Sharp 2-Factors in Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths and cycles in tough graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(*\)-closure for graphs and claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through given vertices and closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumference of Graphs with Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through ten vertices in 3-connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem for Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large cycles in Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Longest Cycle Problem in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Mader / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Paths and Cycles of Superpolylogarithmic Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Simple Paths in Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness exponents of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Exact Algorithm for Cubic Graph TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in 3-connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Edge-Splitting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming meets the principle of inclusion and exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple paths on polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in 3‐connected graphs in orientable surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-splittings preserving local edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonian line graphs and connectivity / rank
 
Normal rank

Latest revision as of 02:25, 4 July 2024

scientific article
Language Label Description Also known as
English
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
scientific article

    Statements

    Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2011
    0 references
    0 references
    claw-free graph
    0 references
    Eulerian subgraph
    0 references
    cubic graph
    0 references
    circumference
    0 references
    Ryjáček closure
    0 references
    line graph
    0 references
    edge-splitting
    0 references
    cyclability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references