Hamiltonian problems in directed graphs with simple row patterns (Q2143132): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114129130, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3888545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Theory and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval digraphs: An analogue of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation reconstruction from differences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3353038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian property of consecutive-\(d\) digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulant graphs: recognizing and isomorphism testing in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / 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: The Hamiltonian property of linear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Hamilton cycles in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonicity of circulant digraphs of outdegree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in circulant digraphs with two stripes / rank
 
Normal rank

Latest revision as of 03:06, 29 July 2024

scientific article
Language Label Description Also known as
English
Hamiltonian problems in directed graphs with simple row patterns
scientific article

    Statements

    Hamiltonian problems in directed graphs with simple row patterns (English)
    0 references
    0 references
    31 May 2022
    0 references
    Hamiltonian problems
    0 references
    complexity of algorithms
    0 references
    linear ordering of the vertices
    0 references
    consecutive ones property
    0 references

    Identifiers