Éva Czabarka

Audace A. V. Dossou-Olory

Eur. J. Comb., 2025

2024

The Largest Crossing Number of Tanglegrams.

[BibT_eX]

[DOI]

Junsheng Liu

László Székely

Electron. J. Comb., 2024

2023

Maximum diameter of 3- and 4-colorable graphs.

[BibT_eX]

[DOI]

Stephen J. Smith

J. Graph Theory, 2023

A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square.

[BibT_eX]

[DOI]

CoRR, 2023

2022

An Infinite Antichain of Planar Tanglegrams.

[BibT_eX]

[DOI]

Stephen J. Smith

Order, 2022

Proximity in triangulations and quadrangulations.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2022

Minimum Wiener index of triangulations and quadrangulations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza.

[BibT_eX]

[DOI]

Inne Singgih

J. Comb. Theory B, 2021

A Size Condition for Diameter Two Orientable Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Wiener Index and Remoteness in Triangulations and Quadrangulations.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

On the Maximum Diameter of $k$-Colorable Graphs.

[BibT_eX]

[DOI]

Inne Singgih

Electron. J. Comb., 2021

The Steiner distance problem for large vertex subsets in the hypercube.

[BibT_eX]

[DOI]

Josiah Reiswig

László Székely

Bull. ICA, 2021

2020

Inducibility of d-ary trees.

[BibT_eX]

[DOI]

Audace A. V. Dossou-Olory

Discret. Math., 2020

2019

A tanglegram Kuratowski theorem.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

A degree condition for diameter two orientability of graphs.

[BibT_eX]

[DOI]

Peter Dankelmann

Discret. Math., 2019

2018

On the Number of Nonisomorphic Subtrees of a Tree.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Enumerations of peaks and valleys on non-decreasing Dyck paths.

[BibT_eX]

[DOI]

Discret. Math., 2018

Analogies between the Crossing Number and the Tangle Crossing Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

Inducibility in Binary Trees and Crossings in Random Tanglegrams.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Paths vs. Stars in the Local Profile of Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

On the Number of Non-Zero Elements of Joint Degree Vectors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2015

A Discrete Convolution on the Generalized Hosoya Triangle.

[BibT_eX]

[DOI]

Rigoberto Flórez

Leandro Junes

J. Integer Seq., 2015

On realizations of a joint degree matrix.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Some Enumerations on Non-Decreasing Dyck Paths.

[BibT_eX]

[DOI]

Rigoberto Flórez

Leandro Junes

Electron. J. Comb., 2015

2014

Dominating Scale-Free Networks Using Generalized Probabilistic Methods.

[BibT_eX]

[DOI]

Boleslaw K. Szymanski

György Korniss

CoRR, 2014

2013

Generating functions for multi-labeled trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner.

[BibT_eX]

[DOI]

Matteo Marsili

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals.

[BibT_eX]

[DOI]

Harout K. Aydinian

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Minimizing the number of episodes and Gallai's theorem on intervals

[BibT_eX]

[DOI]

Todd J. Vision

CoRR, 2012

2011

A tour of M-part L-Sperner families.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

2010

General Lower Bounds for the Minor Crossing Number of Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

A note on full transversals and mixed orthogonal arrays.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

2009

Diameter of 4-colourable graphs.

[BibT_eX]

[DOI]

Peter Dankelmann

Eur. J. Comb., 2009

The inverse problem for certain tree parameters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

2007

Graph minors and the crossing number of graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

2004

Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

2000

Algorithms for optimizing production DNA sequencing.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Intersecting Chains In Finite Vector Spaces.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1999

1996

On Fault-Tolerant Embedding of Hamiltonian Circuits in Line Digraph Interconnection Networks.

[BibT_eX]

[DOI]

Suresh Viswanathan