Decycling numbers of random regular graphs
- 18 October 2002
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 21 (3-4) , 397-413
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Large induced forests in sparse graphsJournal of Graph Theory, 2001
- Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular GraphsJournal of Combinatorial Theory, Series B, 2001
- A POLYNOMIAL ALGORITHM FOR FINDING THE MINIMUM FEEDBACK VERTEX SET OF A 3-REGULAR SIMPLE GRAPH 1Acta Mathematica Scientia, 1999
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set ProblemSIAM Journal on Discrete Mathematics, 1999
- Decycling graphsJournal of Graph Theory, 1997
- On the feedback vertex set problem in permutation graphsInformation Processing Letters, 1994
- Lower Bounds For Induced Forests in Cubic GraphsCanadian Mathematical Bulletin, 1987
- Maximum induced trees in graphsJournal of Combinatorial Theory, Series B, 1986
- Reducibility among Combinatorial Problems1972
- Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wirdAnnalen der Physik, 1847