( en | de | ru )

 

Disambiguation of "Simonyi, Gábor"

Author of the publication

copydeleteadd this publication to your clipboard
Families of graph-different Hamilton paths

, , and . CoRR, (2011)

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.

Tibor Gábori

Gábor Hegyi

Gábor Köller

Gábor Kiss

Gábor Vészi

 

Other publications of authors with the same name

Structured Codes of Graphs., , , , and . SIAM J. Discret. Math., 37 (1): 379-403 (March 2023)Orientations of Self-complementary Graphs and the Relation of Sperner and Shannon Capacities., and . Eur. J. Comb., 20 (1): 93-99 (1999)Families of graph-different Hamilton paths, , and . CoRR, (2011)On the minimum number of edges giving maximum oriented chromatic number., , , and . Contemporary Trends in Discrete Mathematics, volume 49 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 179-182. DIMACS/AMS, (1997)Perfection, Imperfection, and Graph Entropy.. Electron. Notes Discret. Math., (2000)Graph entropy: A survey.. Combinatorial Optimization, volume 20 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 399-441. DIMACS/AMS, (1993)Oriented list colouring of undirected graphs., and . Contemporary Trends in Discrete Mathematics, volume 49 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 307-316. DIMACS/AMS, (1997)On types of growth for graph-different permutations, , and . CoRR, (2007)On multichromatic numbers of widely colorable graphs., and . J. Graph Theory, 100 (2): 346-361 (2022)Recovering Set Systems and Graph Entropy., and . Comb. Probab. Comput., 6 (4): 481-491 (1997)