On the critical point‐arboricity graphs
- 29 November 2001
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 39 (1) , 50-61
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Coloring Graphs without Short Non-bounding CyclesJournal of Combinatorial Theory, Series B, 1994
- Five-Coloring Maps on SurfacesJournal of Combinatorial Theory, Series B, 1993
- Point Arboricity Critical Graphs ExistJournal of the London Mathematical Society, 1975
- Excess in critical graphsJournal of Combinatorial Theory, Series B, 1975
- Critical Point-Arboritic GraphsJournal of the London Mathematical Society, 1975
- Point-Arboricity and GirthJournal of the London Mathematical Society, 1974
- Intersection theorems for systems of setsJournal of Combinatorial Theory, Series A, 1972
- On Graphs with Prescribed Clique Number and Point-ArboricityJournal of the London Mathematical Society, 1971
- An Analogue to the Heawood Map-Colouring ProblemJournal of the London Mathematical Society, 1969
- The Point-Arboricity of Planar GraphsJournal of the London Mathematical Society, 1969