Domination in Cubic Graphs of Large Girth (Q5302753): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2125541118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum independent dominating sets of random cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in a graph with a 2‐factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination in connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the domination number of \(n\)-vertex connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs of minimum degree at least two and large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dominating number of a random cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Stars and the Number Three / rank
 
Normal rank

Latest revision as of 22:47, 28 June 2024

scientific article; zbMATH DE number 5490457
Language Label Description Also known as
English
Domination in Cubic Graphs of Large Girth
scientific article; zbMATH DE number 5490457

    Statements

    Identifiers