| Publication | Date of Publication | Type |
|---|
Dense circuit graphs and the planar Turán number of a cycle
Journal of Graph Theory | 2024-11-24 | Paper |
Linkages and removable paths avoiding vertices
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
A class of trees determined by their chromatic symmetric functions
Discrete Mathematics | 2024-06-11 | Paper |
On approximations for constructing required subgraphs using stock pieces of fixed length
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
| Dense circuit graphs and the planar Tur\'an number of a cycle | 2023-10-10 | Paper |
4‐Separations in Hajós graphs
Journal of Graph Theory | 2023-10-05 | Paper |
Partitioning digraphs with outdegree at least 4
Journal of Graph Theory | 2023-10-04 | Paper |
Wheels in planar graphs and Hajós graphs
Journal of Graph Theory | 2023-10-04 | Paper |
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2023-09-19 | Paper |
Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
Journal of Combinatorial Theory. Series B | 2023-08-10 | Paper |
| Planar Tur\'an number of the 7-cycle | 2023-06-23 | Paper |
| Linkages and removable paths avoiding vertices | 2023-03-21 | Paper |
| On stability of rainbow matchings | 2023-02-13 | Paper |
A better bound on the size of rainbow matchings
Journal of Combinatorial Theory. Series A | 2023-01-04 | Paper |
Approximating TSP walks in subcubic graphs
Journal of Combinatorial Theory. Series B | 2022-11-28 | Paper |
Tutte paths and long cycles in circuit graphs
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
On the rainbow matching conjecture for 3-uniform hypergraphs
Science China. Mathematics | 2022-10-25 | Paper |
\(1\)-line minimum rectilinear Steiner trees and related problems
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Rainbow perfect matchings for 4-uniform hypergraphs
SIAM Journal on Discrete Mathematics | 2022-07-28 | Paper |
On judicious bipartitions of graphs
Combinatorica | 2022-06-29 | Paper |
Counting Hamiltonian cycles in planar triangulations
Journal of Combinatorial Theory. Series B | 2022-04-27 | Paper |
A note on exact minimum degree threshold for fractional perfect matchings
Graphs and Combinatorics | 2022-04-11 | Paper |
Approximating TSP walks in subcubic graphs
(available as arXiv preprint) | 2021-12-12 | Paper |
| On the 3-colorability of triangle-free and fork-free graphs | 2021-11-19 | Paper |
Rainbow matchings for 3-uniform hypergraphs
Journal of Combinatorial Theory. Series A | 2021-07-14 | Paper |
| On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) | 2021-07-05 | Paper |
| On Tutte cycles containing three prescribed edges | 2021-06-17 | Paper |
Number of Hamiltonian cycles in planar triangulations
SIAM Journal on Discrete Mathematics | 2021-05-28 | Paper |
Nearly perfect matchings in uniform hypergraphs
SIAM Journal on Discrete Mathematics | 2021-05-28 | Paper |
Monochromatic subgraphs in iterated triangulations
The Electronic Journal of Combinatorics | 2020-11-05 | Paper |
The Kelmans-Seymour conjecture. I: Special separations
Journal of Combinatorial Theory. Series B | 2020-07-07 | Paper |
The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
Journal of Combinatorial Theory. Series B | 2020-07-07 | Paper |
The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
Journal of Combinatorial Theory. Series B | 2020-07-07 | Paper |
The Kelmans-Seymour conjecture. IV: A proof
Journal of Combinatorial Theory. Series B | 2020-07-07 | Paper |
| Large cycles in essentially 4-connected graphs | 2020-03-21 | Paper |
A bound on judicious bipartitions of directed graphs
Science China. Mathematics | 2020-03-06 | Paper |
7-connected graphs are 4-ordered
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Minimum codegree condition for perfect matchings in k‐partite k‐graphs
Journal of Graph Theory | 2019-12-30 | Paper |
On problems about judicious bipartitions of graphs
Journal of Combinatorial Theory. Series B | 2019-11-21 | Paper |
Graph-Based Robust Resource Allocation for Cognitive Radio Networks
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Disjoint perfect matchings in 3‐uniform hypergraphs
Journal of Graph Theory | 2018-07-13 | Paper |
Almost perfect matchings in \(k\)-partite \(k\)-graphs
SIAM Journal on Discrete Mathematics | 2018-02-22 | Paper |
On judicious bipartitions of graphs
Combinatorica | 2018-02-22 | Paper |
On Rainbow Matchings for Hypergraphs
SIAM Journal on Discrete Mathematics | 2018-02-07 | Paper |
Bisections of graphs without short cycles
Combinatorics, Probability and Computing | 2018-01-19 | Paper |
| Some results and problems about circumferences of graphs | 2017-12-11 | Paper |
Circumference of 3-connected cubic graphs
Journal of Combinatorial Theory. Series B | 2017-11-28 | Paper |
Induced forests in bipartite planar graphs
Journal of Combinatorics | 2017-01-10 | Paper |
Graphs containing topological \(H\)
Journal of Graph Theory | 2016-06-10 | Paper |
On a coloring conjecture of Hajós
Graphs and Combinatorics | 2016-03-02 | Paper |
Nonseparating cycles avoiding specific vertices
Journal of Graph Theory | 2016-02-01 | Paper |
On tight components and anti-tight components
Graphs and Combinatorics | 2015-12-17 | Paper |
Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
Journal of Combinatorial Theory. Series B | 2015-06-10 | Paper |
An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
Science China. Mathematics | 2015-03-26 | Paper |
Forbidden subgraphs and 3-colorings
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
On judicious bisections of graphs
Journal of Combinatorial Theory. Series B | 2014-08-28 | Paper |
Approximate min-max relations on plane graphs
Journal of Combinatorial Optimization | 2013-08-09 | Paper |
The circumference of a graph with no \(K_{3,t}\)-minor. II
Journal of Combinatorial Theory. Series B | 2013-01-14 | Paper |
Maximum directed cuts in graphs with degree constraints
Graphs and Combinatorics | 2012-12-27 | Paper |
Bonds with parity constraints
Journal of Combinatorial Theory. Series B | 2012-05-11 | Paper |
Upper bounds on minimum balanced bipartitions
Discrete Mathematics | 2012-04-13 | Paper |
Partitioning 3-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2012-03-19 | Paper |
Maximum IPP codes of length 3
Annals of Combinatorics | 2012-01-24 | Paper |
Better bounds for \(k\)-partitions of graphs
Combinatorics, Probability and Computing | 2011-08-16 | Paper |
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
Journal of Combinatorial Theory. Series B | 2011-05-19 | Paper |
Approximating the chromatic index of multigraphs
Journal of Combinatorial Optimization | 2011-03-17 | Paper |
On a bipartition problem of Bollobás and Scott
Combinatorica | 2011-02-08 | Paper |
On several partitioning problems of Bollobás and Scott
Journal of Combinatorial Theory. Series B | 2010-11-05 | Paper |
Independent paths and \(K_{5}\)-subdivisions
Journal of Combinatorial Theory. Series B | 2010-11-05 | Paper |
A note on balanced bipartitions
Discrete Mathematics | 2010-10-18 | Paper |
Bounds for pairs in partitions of graphs
Discrete Mathematics | 2010-07-07 | Paper |
Balanced judicious bipartitions of graphs
Journal of Graph Theory | 2010-03-15 | Paper |
Hamilton Cycles in Planar Locally Finite Graphs
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Judicious \(k\)-partitions of graphs
Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
Hamilton circles in infinite planar graphs
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
Truncation for Low-Complexity MIMO Signal Detection
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Infinite paths in planar graphs V, 3‐indivisible graphs
Journal of Graph Theory | 2008-05-14 | Paper |
Triangle-free subcubic graphs with minimum bipartite density
Journal of Combinatorial Theory. Series B | 2008-04-28 | Paper |
On the reconstruction of planar graphs
Journal of Combinatorial Theory. Series B | 2007-08-20 | Paper |
Approximating Longest Cycles in Graphs with Bounded Degrees
SIAM Journal on Computing | 2007-06-26 | Paper |
Contractible subgraphs ink-connected graphs
Journal of Graph Theory | 2007-06-11 | Paper |
Infinite paths in planar graphs IV, dividing cycles
Journal of Graph Theory | 2007-02-07 | Paper |
The circumference of a graph with no \(K_{3,t}\)-minor
Journal of Combinatorial Theory. Series B | 2007-01-16 | Paper |
Contractible cliques in \(k\)-connected graphs
Graphs and Combinatorics | 2007-01-05 | Paper |
| scientific article; zbMATH DE number 5077174 (Why is no real title available?) | 2006-12-05 | Paper |
Reducing Hajós' 4-coloring conjecture to 4-connected graphs
Journal of Combinatorial Theory. Series B | 2006-07-12 | Paper |
Finding Four Independent Trees
SIAM Journal on Computing | 2006-06-01 | Paper |
Nonseparating Planar Chains in 4-Connected Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Chain Decompositions of 4-Connected Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Infinite paths in planar graphs III, 1-way infinite paths
Journal of Graph Theory | 2006-05-16 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Hamilton paths in toroidal graphs
Journal of Combinatorial Theory. Series B | 2005-08-05 | Paper |
Infinite paths in planar graphs II, structures and ladder nets
Journal of Graph Theory | 2005-05-12 | Paper |
Covering planar graphs with forests
Journal of Combinatorial Theory. Series B | 2005-05-04 | Paper |
Non-separating paths in 4-connected graphs
Annals of Combinatorics | 2005-04-28 | Paper |
Circumference of Graphs with Bounded Degree
SIAM Journal on Computing | 2005-02-21 | Paper |
Infinite paths in planar graphs I: Graphs with radial nets
Journal of Graph Theory | 2005-02-16 | Paper |
Positively curved cubic plane graphs are finite
Journal of Graph Theory | 2005-02-16 | Paper |
Cycles in 4-connected planar graphs
European Journal of Combinatorics | 2004-10-04 | Paper |
Graph connectivity after path removal
Combinatorica | 2004-09-07 | Paper |
| scientific article; zbMATH DE number 2079338 (Why is no real title available?) | 2004-07-28 | Paper |
Hamiltonian knot projections and lengths of thick knots.
Topology and its Applications | 2004-02-03 | Paper |
Nonseparating Cycles in 4-Connected Graphs
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Disjoint paths in graphs. III: Characterization
Annals of Combinatorics | 2003-09-16 | Paper |
Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
Annals of Combinatorics | 2003-08-14 | Paper |
Disjoint paths in graphs. II: A special case
Annals of Combinatorics | 2003-08-14 | Paper |
Hamilton cycles in plane triangulations
Journal of Graph Theory | 2003-03-19 | Paper |
Long cycles in 3‐connected graphs in orientable surfaces
Journal of Graph Theory | 2003-03-19 | Paper |
Long cycles in 3-connected graphs
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
A note on fragile graphs
Discrete Mathematics | 2002-05-28 | Paper |
Tutte cycles in circuit graphs
Discrete Mathematics | 1998-08-11 | Paper |
Subdivisions in planar graphs
Journal of Combinatorial Theory. Series B | 1997-09-15 | Paper |
Convex programming and circumference of 3-connected graphs of low genus
Journal of Combinatorial Theory. Series B | 1997-08-03 | Paper |
Five-connected toroidal graphs are Hamiltonian
Journal of Combinatorial Theory. Series B | 1997-07-20 | Paper |
Disjoint paths, planarizing cycles, and spanning walks
Transactions of the American Mathematical Society | 1997-04-08 | Paper |
| scientific article; zbMATH DE number 932195 (Why is no real title available?) | 1996-11-25 | Paper |
| scientific article; zbMATH DE number 786140 (Why is no real title available?) | 1996-04-23 | Paper |
Non-contractible edges in a 3-connected graph
Combinatorica | 1995-10-17 | Paper |
On hamiltonian‐connected graphs
Journal of Graph Theory | 1995-06-11 | Paper |
3‐connected graphs with non‐cut contractible edge covers of size k
Journal of Graph Theory | 1995-03-02 | Paper |
4-connected projective planar graphs are Hamiltonian
Journal of Combinatorial Theory. Series B | 1994-12-01 | Paper |
The 3‐connected graphs with a maximum matching containing precisely one contractible edge
Journal of Graph Theory | 1994-08-29 | Paper |
Small circuit double covers of cubic multigraphs
Journal of Combinatorial Theory. Series B | 1994-06-06 | Paper |
Independence ratios of graph powers
Discrete Mathematics | 1994-05-05 | Paper |
Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three
Journal of Graph Theory | 1993-08-17 | Paper |
| scientific article; zbMATH DE number 166075 (Why is no real title available?) | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 139920 (Why is no real title available?) | 1993-03-28 | Paper |
On 3-connected graphs with contractible edge covers of size \(k\)
Discrete Mathematics | 1993-01-16 | Paper |
Ends in spanning trees
Discrete Mathematics | 1993-01-16 | Paper |
Cyclomatic numbers of connected induced subgraphs
Discrete Mathematics | 1993-01-16 | Paper |
On several symmetry conditions for graphs
Discrete Mathematics | 1992-09-27 | Paper |
On a problem of Hendry
Discrete Mathematics | 1992-09-27 | Paper |
On neighbourhood line graphs
Discrete Mathematics | 1992-06-28 | Paper |
Trees and unicyclic graphs with hamiltonian path graphs
Journal of Graph Theory | 1992-06-25 | Paper |
Non-separating cycles and discrete Jordan curves
Journal of Combinatorial Theory. Series B | 1992-01-01 | Paper |
On the cycle‐isomorphism of graphs
Journal of Graph Theory | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4132204 (Why is no real title available?) | 1990-01-01 | Paper |
Claw‐free graphs are edge reconstructible
Journal of Graph Theory | 1988-01-01 | Paper |
A class of trees determined by their chromatic symmetric functions
(available as arXiv preprint) | N/A | Paper |
