Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs., , and . Electron. Notes Discret. Math., (2002)A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected., and . Australas. J Comb., (2005)A 2-factor in which each cycle contains a vertex in a specified stable set., , and . Australas. J Comb., (2010)Upper Bounds on the Paired Domination Subdivision Number of a Graph., , and . Graphs Comb., 29 (4): 843-856 (2013)The maximal number of inducedr-partite subgraphs., , , and . Graphs Comb., 11 (1): 1-19 (1995)Lower Bound on the Number of Contractible Edges in a 4-Connected Graph with Edges Not Contained in Triangles., , and . Graphs Comb., 34 (5): 965-987 (2018)Graphs G for which both G and G- are Contraction Critically k-Connected., , and . Graphs Comb., 18 (4): 693-708 (2002)The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity., , , , and . J. Graph Theory, 68 (1): 77-89 (2011)Spanning Trees with Vertices Having Large Degrees., and . J. Graph Theory, 79 (3): 213-221 (2015)Two-factors each component of which contains a specified vertex., , , , and . J. Graph Theory, 43 (3): 188-198 (2003)