André E. Kézdy

Discret. Math., August, 2023

2022

Systems of Overlap Representation for Families of Intervals.

[BibT_eX]

[DOI]

Graphs Comb., 2022

2021

Path-pairability of infinite planar grids.

[BibT_eX]

[DOI]

Period. Math. Hung., 2021

Minimal 2-connected graphs satisfying the even cut condition.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Eckhoff's Problem on Convex Sets in the Plane.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

All Minor-Minimal Apex Obstructions with Connectivity Two.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

Petruska's question on planar convex sets.

[BibT_eX]

[DOI]

Timothy J. Pervenecki

Géza Tóth

Discret. Math., 2020

Note on the bisection width of cubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

The path-pairability number of products of stars.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

2018

Linkage on the infinite grid.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

The minimum size of graphs satisfying cut conditions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2016

Detour trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2014

Connected matchings in chordal bipartite graphs.

[BibT_eX]

[DOI]

Susan C. White

Discret. Optim., 2014

The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs.

[BibT_eX]

Timothy M. Brauch

Ars Comb., 2014

2009

Generalized Schur Numbers for x1 + x2 + c = 3x3.

[BibT_eX]

[DOI]

Susan C. White

Electron. J. Comb., 2009

2008

On the editing distance of graphs.

[BibT_eX]

[DOI]

Maria Axenovich

Ryan R. Martin

J. Graph Theory, 2008

2006

rho-Valuations for some stunted trees.

[BibT_eX]

[DOI]

Discret. Math., 2006

Odd cycles and Theta-cycles in hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

2004

Polynomials that Vanish on Distinct nth Roots of Unity.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

2003

Heavy Transversals and Indecomposable Hypergraphs.

[BibT_eX]

[DOI]

Robert C. Powers

Comb., 2003

2002

A finite basis characterization of ?-split colorings.

[BibT_eX]

[DOI]

András Gyárfás

Discret. Math., 2002

Distinct Sums Modulo N And Tree Embeddings.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

2001

A proof of Hougardy's conjecture for diamond-free graphs.

[BibT_eX]

[DOI]

Matthew Scobee

Discret. Math., 2001

2000

Clique covering the edges of a locally cobipartite graph.

[BibT_eX]

[DOI]

Edward R. Scheinerman

Chi Wang

Discret. Math., 2000

1999

Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling.

[BibT_eX]

[DOI]

Chi Wang

Discret. Math., 1999

Scenic graphs II: non-traceable graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1999

1998

Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete.

[BibT_eX]

[DOI]

Networks, 1998

Tough enough chordal graphs are Hamiltonian.

[BibT_eX]

[DOI]

Networks, 1998

Scenic Graphs I: Traceable Graphs.

[BibT_eX]

Ars Comb., 1998

1997

On Extensions of a Conjecture of Gallai.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1997

Recognizing Intersection Graphs of Linear Uniform Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1997

1996

Partitioning Permutations into Increasing and Decreasing Subsequences.

[BibT_eX]

[DOI]

Chi Wang

J. Comb. Theory, Ser. A, 1996

1995

The 2-intersection number of paths and bounded-degree trees.

[BibT_eX]

[DOI]

Douglas B. West

J. Graph Theory, 1995

1992

Sequential and Parallel Algorithms to Find a K5 Minor.

[BibT_eX]

[DOI]

Patrick McGuinness

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991

Do 3n - 5 edges force a subdivision of K5?

[BibT_eX]

[DOI]