Hamiltonicity in Split Graphs - A Dichotomy (Q2971662): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1610.00855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in interval graph generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved degree conditions for Hamiltonian properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The P versus NP-complete dichotomy of some challenging problems in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in graphs with prescribed toughness and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits determining the order of chromosomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, hamiltonicity and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: General solutions to the single vehicle routing problem with pickups and deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some intriguing problems in Hamiltonian graph theory---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian circuits in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Steiner Tree in Split Graphs - Dichotomy Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Burkard-Hammer condition for Hamiltonian split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected (s,t)-Vertex Separator Parameterized by Chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the hamiltonian problem—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on the Hamiltonian problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs / rank
 
Normal rank

Latest revision as of 15:23, 13 July 2024

scientific article
Language Label Description Also known as
English
Hamiltonicity in Split Graphs - A Dichotomy
scientific article

    Statements

    Hamiltonicity in Split Graphs - A Dichotomy (English)
    0 references
    0 references
    0 references
    7 April 2017
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references