Induced Forests in Regular Graphs with Large Girth (Q3545905): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 0709.3126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fragmentability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Independent Domination Number of Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential equations for random processes and random graphs / 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: The asymptotic distribution of short cycles in random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling numbers of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the feedback vertex set problem in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large independent sets in regular graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum induced trees in graphs / rank
 
Normal rank

Latest revision as of 22:40, 28 June 2024