On the length of longest dominating cycles in graphs (Q1309474): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vũ Đình Hòa / rank
Normal rank
 
Property / author
 
Property / author: Vũ Đình Hòa / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über Hamiltonsche Kreise und unabhängige Ecken in Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in graphs with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a result of Häggkvist and Nicoghossian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Struktursatz für 2-fach zusammenhängende Graphen mit großer Minimalvalenz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858942 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:02, 22 May 2024

scientific article
Language Label Description Also known as
English
On the length of longest dominating cycles in graphs
scientific article

    Statements

    On the length of longest dominating cycles in graphs (English)
    0 references
    24 January 1994
    0 references
    dominating cycle
    0 references
    longest cycle
    0 references
    1-tough cycle-dominable graph
    0 references
    bounds
    0 references
    0 references

    Identifiers