2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Four sufficient conditions for hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in interval graph generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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: Q3211339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Hamiltonian paths in a rectangular grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / 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: Characterizing forbidden pairs for hamiltonian properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onk-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbourhood unions and Hamiltonian properties in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for <i>k</i>‐ordered hamiltonian graphs / 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: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for a graph to be Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of triangular grid 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: Forbidden subgraphs and Hamiltonian properties and graphs / 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: Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm to find Hamiltonian cycles in proper interval 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian circuits in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onk-ordered Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Class of Hypohamiltonian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Hamiltonian circuit problem on directed path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-ordered Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time recognition algorithm for proper interval graphs / 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
Property / cites work
 
Property / cites work: Hypohamiltonian and hypotraceable graphs / rank
 
Normal rank

Revision as of 17:44, 1 August 2024

scientific article; zbMATH DE number 7713034
Language Label Description Also known as
English
2-Trees: Structural insights and the study of Hamiltonian paths
scientific article; zbMATH DE number 7713034

    Statements

    2-Trees: Structural insights and the study of Hamiltonian paths (English)
    0 references
    0 references
    0 references
    15 July 2023
    0 references
    Hamiltonian path
    0 references
    2-trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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