A compilation of relations between graph invariants—supplement I
- 1 July 1991
- Vol. 21 (4), 421-455
- https://doi.org/10.1002/net.3230210405
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- On the Edge Independence Number of a Regular Graph with Large Edge ConnectivityaAnnals of the New York Academy of Sciences, 1989
- On the genus and thickness of graphsJournal of Combinatorial Theory, Series B, 1987
- An inequality involving the vertex arboricity and edge arboricity of a graphJournal of Graph Theory, 1986
- Computationally Efficient Bounds for the Catalan NumbersEuropean Journal of Combinatorics, 1986
- The longest cycle of a graph with a large minimal degreeJournal of Graph Theory, 1986
- A compilation of relations between graph invariantsNetworks, 1985
- Upper bounds on the edge clique cover number of a graphDiscrete Mathematics, 1984
- Extremal non-bipartite regular graphs of girth 4Journal of Combinatorial Theory, Series B, 1984
- Girth and Independence RatioCanadian Mathematical Bulletin, 1982
- Graphs with even girth and small excessMathematical Proceedings of the Cambridge Philosophical Society, 1980