Author of the publication

Geodetic Convexity Parameters for Graphs with Few Short Induced Paths.

, , and . WG, volume 9941 of Lecture Notes in Computer Science, page 25-37. (2016)

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

On some tractable and hard instances for partial incentives and target set selection., and . CoRR, (2018)Characterization and recognition of Radon-independent sets in split graphs., , , and . Inf. Process. Lett., 112 (24): 948-952 (2012)Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity., , , and . WG, volume 7551 of Lecture Notes in Computer Science, page 262-273. Springer, (2012)Pairs of Disjoint Dominating Sets in Connected Cubic Graphs., and . Graphs Comb., 28 (3): 407-421 (2012)Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs., and . Graphs Comb., 26 (3): 407-424 (2010)Smallest domination number and largest independence number of graphs and forests with given degree sequence., , and . J. Graph Theory, 88 (1): 131-145 (2018)On the Carathéodory Number for the Convexity of Paths of Order Three., , , , and . Electron. Notes Discret. Math., (2011)The Geodetic Hull Number is Hard for Chordal Graphs., , , and . Electron. Notes Discret. Math., (2017)A short proof for a lower bound on the zero forcing number., and . Discussiones Mathematicae Graph Theory, 40 (1): 355-360 (2020)On defensive alliances and strong global offensive alliances., , , , and . Discret. Appl. Math., (2014)