Types of triangle in Hamiltonian triangulations and an application to domination and k-walks (Q5217058): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127638841, #quickstatements; #temporary_batch_1722209980517
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Nicolas Van Cleemput / rank
Normal rank
 
Property / author
 
Property / author: Nicolas Van Cleemput / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: plantri / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.26493/1855-3974.1733.8c6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2951789949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3548359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra with few 3-cuts are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dominating sets of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-walks in circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of hamiltonian cycles in a maximal planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning closed walks and TSP in 3-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-trees with few vertices of degree 3 in circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective planar graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets of maximal outerplanar graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127638841 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:50, 29 July 2024

scientific article; zbMATH DE number 7172030
Language Label Description Also known as
English
Types of triangle in Hamiltonian triangulations and an application to domination and k-walks
scientific article; zbMATH DE number 7172030

    Statements

    Types of triangle in Hamiltonian triangulations and an application to domination and k-walks (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2020
    0 references
    Hamiltonian cycle
    0 references
    domination
    0 references
    3-walk
    0 references

    Identifiers

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