Gábor Simonyi

Graphs Comb., May, 2024

2023

Structured Codes of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2023

Shannon capacity, Lovász theta number and the Mycielski construction.

[BibT_eX]

[DOI]

Bence Csonka

CoRR, 2023

2022

On multichromatic numbers of widely colorable graphs.

[BibT_eX]

[DOI]

Anna Gujgiczer

J. Graph Theory, 2022

Codes with structured Hamming distance in graph families.

[BibT_eX]

[DOI]

Anna Gujgiczer

CoRR, 2022

2021

Partitioning Transitive Tournaments into Isomorphic Digraphs.

[BibT_eX]

[DOI]

Order, 2021

Shannon Capacity and the Categorical Product.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

On Colorful Edge Triples in Edge-Colored Complete Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2020

2016

Orientations Making k-Cycles Cyclic.

[BibT_eX]

[DOI]

Zita Helle

Graphs Comb., 2016

2015

Dilworth Rate: A Generalization of Witsenhausen's Zero-Error Rate for Directed Graphs.

[BibT_eX]

[DOI]

Ágnes Tóth

IEEE Trans. Inf. Theory, 2015

Relations between the Local Chromatic Number and Its Directed Version.

[BibT_eX]

[DOI]

Ambrus Zsbán

J. Graph Theory, 2015

2014

A generalization of Witsenhausen's zero-error rate for directed graphs.

[BibT_eX]

[DOI]

Ágnes Tóth

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Colourful Theorems and Indices of Homomorphism Complexes.

[BibT_eX]

[DOI]

Claude Tardif

Ambrus Zsbán

Electron. J. Comb., 2013

Local chromatic number of quadrangulations of surfaces.

[BibT_eX]

[DOI]

Bojan Mohar

Comb., 2013

2012

Families of Graph-different Hamilton Paths.

[BibT_eX]

[DOI]

Silvia Messuti

SIAM J. Discret. Math., 2012

Gallai colorings and domination in multipartite digraphs.

[BibT_eX]

[DOI]

András Gyárfás

Ágnes Tóth

J. Graph Theory, 2012

2011

On directed local chromatic number, shift graphs, and Borsuk-like graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Families of Very Different Paths.

[BibT_eX]

[DOI]

Silvia Messuti

Electron. Notes Discret. Math., 2011

Permutation Capacities and Oriented Infinite Paths.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Permutation Capacities of Families of Oriented Infinite Paths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

On topological relaxations of chromatic conjectures.

[BibT_eX]

[DOI]

Ambrus Zsbán

Eur. J. Comb., 2010

2009

On types of growth for graph-different permutations.

[BibT_eX]

[DOI]

Blerina Sinaimeri

J. Comb. Theory A, 2009

2008

Graph-Different Permutations.

[BibT_eX]

[DOI]

Claudia Malvenuto

SIAM J. Discret. Math., 2008

Necklace Bisection with One Cut Less than Needed.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

Colorful subgraphs in Kneser-like graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

2006

Asymptotic values of the Hall-ratio for graph powers.

[BibT_eX]

[DOI]

Discret. Math., 2006

Local Chromatic Number, KY Fan's Theorem, And Circular Colorings.

[BibT_eX]

[DOI]

Comb., 2006

2005

Local chromatic number and Sperner capacity.

[BibT_eX]

[DOI]

Concetta Pilotto

J. Comb. Theory B, 2005

Connected matchings and Hadwiger's conjecture.

[BibT_eX]

[DOI]

Zoltán Füredi

András Gyárfás

Comb. Probab. Comput., 2005

2004

Edge colorings of complete graphs without tricolored triangles.

[BibT_eX]

[DOI]

András Gyárfás

J. Graph Theory, 2004

2003

On Witsenhausen's zero-error rate for multiple sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

2000

Perfection, Imperfection, and Graph Entropy.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Graph Pairs and their Entropies: Modularity Problems.

[BibT_eX]

[DOI]

Comb., 2000

1999

Orientations of Self-complementary Graphs and the Relation of Sperner and Shannon Capacities.

[BibT_eX]

[DOI]

Eur. J. Comb., 1999

1998

Intersecting set systems and graphic matroids<sup>, </sup>.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

Recovering Set Systems and Graph Entropy.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

Oriented list colouring of undirected graphs.

[BibT_eX]

[DOI]

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

On the minimum number of edges giving maximum oriented chromatic number.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Tomasz Luczak

Éric Sopena

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Entropy Splitting Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1996

1994

Different capacities of a digraph.

[BibT_eX]

[DOI]

Graphs Comb., 1994

On the optimal structure of recovering set pairs in lattices: the sandglass conjecture.

[BibT_eX]

[DOI]

Rudolf Ahlswede

Discret. Math., 1994

1993

Graph entropy: A survey.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 1993

1992

A Sperner-Type Theorem and Qualitative Independence.

[BibT_eX]

J. Comb. Theory A, 1992

Perfect couples of graphs.

[BibT_eX]

[DOI]

Zsolt Tuza

Comb., 1992

1991

Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory.

[BibT_eX]

[DOI]

Rudolf Ahlswede

IEEE Trans. Inf. Theory, 1991

1990

Entropy splitting for antiblocking corners and perfect graphs.

[BibT_eX]

[DOI]

Comb., 1990

1989

On write-unidirectional memory codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

Coding for write-unidirectional memories and conflict resolution.

[BibT_eX]

[DOI]

Gérard D. Cohen

Discret. Appl. Math., 1989

1988

Separating Partition Systems and Locally Different Sequences.

[BibT_eX]

[DOI]