UB Paderborn / Katalog / Suche / in CDI

Wiener Index and Remoteness in Triangulations and Quadrangulations

Discrete mathematics and theoretical computer science, 2021-03, Vol.23 no. 1 (Graph Theory)

2021

Volltextzugriff (PDF)

Minimum Wiener index of triangulations and quadrangulations

Discrete Applied Mathematics, 2022-12, Vol.322, p.295-310

2022

Volltextzugriff (PDF)

Reducing degeneracy in maximum entropy models of networks

Physical review letters, 2015-04, Vol.114 (15), p.158701-158701, Article 158701

2015

Volltextzugriff (PDF)

A Size Condition for Diameter Two Orientable Graphs

Graphs and combinatorics, 2021-03, Vol.37 (2), p.527-544

2021

Volltextzugriff (PDF)

The Largest Crossing Number of Tanglegrams

The Electronic journal of combinatorics, 2024-03, Vol.31 (1)

2024

Volltextzugriff (PDF)

Analogies between the Crossing Number and the Tangle Crossing Number

The Electronic journal of combinatorics, 2018-11, Vol.25 (4)

2018

Volltextzugriff (PDF)

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

Journal of combinatorial theory. Series B, 2021-11, Vol.151, p.38-45

2021

Volltextzugriff (PDF)

Enumerations of peaks and valleys on non-decreasing Dyck paths

Discrete mathematics, 2018-10, Vol.341 (10), p.2789-2807

2018

Volltextzugriff (PDF)

Maximum diameter of 3‐ and 4‐colorable graphs

Journal of graph theory, 2023-02, Vol.102 (2), p.262-270

2023

Volltextzugriff (PDF)

An Infinite Antichain of Planar Tanglegrams

Order (Dordrecht), 2022-04, Vol.39 (1), p.45-54

2022

Volltextzugriff (PDF)

On the Maximum Diameter of $k$-Colorable Graphs

The Electronic journal of combinatorics, 2021-09, Vol.28 (3)

2021

Volltextzugriff (PDF)

A degree condition for diameter two orientability of graphs

Discrete mathematics, 2019-04, Vol.342 (4), p.1063-1065

2019

Volltextzugriff (PDF)

Erdős–Szekeres theorem for cyclic permutations

Involve (Berkeley, Calif.), 2019-01, Vol.12 (2), p.351-360

2019

Volltextzugriff (PDF)

Inducibility of d-ary trees

Discrete mathematics, 2020-02, Vol.343 (2), p.111671, Article 111671

2020

Volltextzugriff (PDF)

Inducibility in Binary Trees and Crossings in Random Tanglegrams

SIAM journal on discrete mathematics, 2017-01, Vol.31 (3), p.1732-1750

2017

Volltextzugriff (PDF)

A tanglegram Kuratowski theorem

Journal of graph theory, 2019-02, Vol.90 (2), p.111-122

2019

Volltextzugriff (PDF)

On the Number of Nonisomorphic Subtrees of a Tree

Journal of graph theory, 2018-01, Vol.87 (1), p.89-95

2018

Volltextzugriff (PDF)

The Allele Frequency Spectrum in Genome-Wide Human Variation Data Reveals Signals of Differential Demographic History in Three Large World Populations

Genetics (Austin), 2004-01, Vol.166 (1), p.351-372

2004

Volltextzugriff (PDF)

Proximity in triangulations and quadrangulations

Electronic journal of graph theory and applications, 2022-01, Vol.10 (2), p.425

2022

Volltextzugriff (PDF)

On realizations of a joint degree matrix

Discrete Applied Mathematics, 2015-01, Vol.181, p.283-288

2015

Volltextzugriff (PDF)

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

The Electronic journal of combinatorics, 2017-03, Vol.24 (1)

2017

Volltextzugriff (PDF)

Using block designs in crossing number bounds

Journal of combinatorial designs, 2019-10, Vol.27 (10), p.586-597

2019

Volltextzugriff (PDF)

Paths vs. Stars in the Local Profile of Trees

The Electronic journal of combinatorics, 2017-02, Vol.24 (1)

2017

Volltextzugriff (PDF)

An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem

Algebraic statistics (Online), 2021-12, Vol.12 (2), p.115-124

2021

Volltextzugriff (PDF)

Trees in Many Contexts

Notices of the American Mathematical Society, 2022-02, Vol.69 (2), p.1

2022

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Wiener Index and Remoteness in Triangulations and Quadrangulations

Minimum Wiener index of triangulations and quadrangulations

Reducing degeneracy in maximum entropy models of networks

A Size Condition for Diameter Two Orientable Graphs

The Largest Crossing Number of Tanglegrams

Analogies between the Crossing Number and the Tangle Crossing Number

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

Enumerations of peaks and valleys on non-decreasing Dyck paths

Maximum diameter of 3‐ and 4‐colorable graphs

An Infinite Antichain of Planar Tanglegrams

On the Maximum Diameter of $k$-Colorable Graphs

A degree condition for diameter two orientability of graphs

Erdős–Szekeres theorem for cyclic permutations

Inducibility of d-ary trees

Inducibility in Binary Trees and Crossings in Random Tanglegrams

A tanglegram Kuratowski theorem

On the Number of Nonisomorphic Subtrees of a Tree

The Allele Frequency Spectrum in Genome-Wide Human Variation Data Reveals Signals of Differential Demographic History in Three Large World Populations

Proximity in triangulations and quadrangulations

On realizations of a joint degree matrix

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

Using block designs in crossing number bounds

Paths vs. Stars in the Local Profile of Trees

An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem

Trees in Many Contexts

Suchergebnisse filtern