10 results
TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
 Part of

 Journal:
 Bulletin of the Australian Mathematical Society / Volume 106 / Issue 2 / October 2022
 Published online by Cambridge University Press:
 03 December 2021, pp. 195202
 Print publication:
 October 2022

 Article
 Export citation
A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID[a,b]FACTORCRITICAL GRAPHS
 Part of

 Journal:
 Bulletin of the Australian Mathematical Society / Volume 86 / Issue 2 / October 2012
 Published online by Cambridge University Press:
 07 February 2012, pp. 177183
 Print publication:
 October 2012

 Article

 You have access
 Export citation
BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)DELETED GRAPHS
 Part of

 Journal:
 Bulletin of the Australian Mathematical Society / Volume 85 / Issue 1 / February 2012
 Published online by Cambridge University Press:
 14 October 2011, pp. 6067
 Print publication:
 February 2012

 Article

 You have access
 Export citation
A New Sufficient Condition for a Graph To Be (g, f, n)Critical

 Journal:
 Canadian Mathematical Bulletin / Volume 53 / Issue 2 / 01 June 2010
 Published online by Cambridge University Press:
 20 November 2018, pp. 378384
 Print publication:
 01 June 2010

 Article

 You have access
 Export citation
A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)CRITICAL GRAPH

 Journal:
 Glasgow Mathematical Journal / Volume 52 / Issue 2 / May 2010
 Published online by Cambridge University Press:
 29 March 2010, pp. 409415
 Print publication:
 May 2010

 Article

 You have access
 Export citation
NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL kFACTORS OF GRAPHS
 Part of

 Journal:
 Bulletin of the Australian Mathematical Society / Volume 81 / Issue 3 / June 2010
 Published online by Cambridge University Press:
 13 January 2010, pp. 473480
 Print publication:
 June 2010

 Article

 You have access
 Export citation
A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)DELETED GRAPHS*

 Journal:
 Glasgow Mathematical Journal / Volume 52 / Issue 1 / January 2010
 Published online by Cambridge University Press:
 30 July 2009, pp. 3340
 Print publication:
 January 2010

 Article

 You have access
 Export citation
NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)CRITICAL GRAPHS
 Part of

 Journal:
 Bulletin of the Australian Mathematical Society / Volume 77 / Issue 2 / April 2008
 Published online by Cambridge University Press:
 01 April 2008, pp. 277283
 Print publication:
 April 2008

 Article

 You have access
 Export citation
Notes on the binding numbers for (a, b, k)critical graphs

 Journal:
 Bulletin of the Australian Mathematical Society / Volume 76 / Issue 2 / October 2007
 Published online by Cambridge University Press:
 17 April 2009, pp. 307314
 Print publication:
 October 2007

 Article

 You have access
 Export citation
Some sufficient conditions for graphs to have (g, f)factors

 Journal:
 Bulletin of the Australian Mathematical Society / Volume 75 / Issue 3 / June 2007
 Published online by Cambridge University Press:
 17 April 2009, pp. 447452
 Print publication:
 June 2007

 Article

 You have access
 Export citation