2023
J. Comb. Theory, Ser. B, July, 2023
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles.
J. Comb. Theory, Ser. B, 2023
2022
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
2021
Exponentially many Z5-colorings in simple planar graphs.
Discret. Math., 2021
2020
Cycles containing all the odd-degree vertices.
J. Comb. Theory, Ser. B, 2020
Factorizing regular graphs.
J. Comb. Theory, Ser. B, 2020
Cycles in 5-connected triangulations.
J. Comb. Theory, Ser. B, 2020
Group Connectivity and Group Coloring: Small Groups versus Large Groups.
Electron. J. Comb., 2020
Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface.
Electron. J. Comb., 2020
2019
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces.
SIAM J. Discret. Math., 2019
Hamilton cycles in sparse locally connected graphs.
Discret. Appl. Math., 2019
Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices.
CoRR, 2019
2018
Deciding Parity of Graph Crossing Number.
SIAM J. Discret. Math., 2018
Chords in longest cycles.
J. Comb. Theory, Ser. B, 2018
The square of a planar cubic graph is 7-colorable.
J. Comb. Theory, Ser. B, 2018
The flow index and strongly connected orientations.
Eur. J. Comb., 2018
Density of Chromatic Roots in Minor-Closed Graph Families.
Comb. Probab. Comput., 2018
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
2017
On the Minimum Number of Spanning Trees in <i>k</i>-Edge-Connected Graphs.
J. Graph Theory, 2017
The number of colorings of planar graphs with no separating triangles.
J. Comb. Theory, Ser. B, 2017
Cycles through all finite vertex sets in infinite graphs.
Eur. J. Comb., 2017
Decomposing graphs into a constant number of locally irregular subgraphs.
Eur. J. Comb., 2017
Nash-Williams' cycle-decomposition theorem.
Comb., 2017
Infinitely connected subgraphs in graphs of uncountable chromatic number.
Comb., 2017
2016
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture.
J. Comb. Theory, Ser. B, 2016
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity.
Graphs Comb., 2016
Orientations of infinite graphs with prescribed edge-connectivity.
Comb., 2016
2015
Strongly 2-connected orientations of graphs.
J. Comb. Theory, Ser. B, 2015
Extending a perfect matching to a Hamiltonian cycle.
Discret. Math. Theor. Comput. Sci., 2015
The minimum number of minimal codewords in an [n, k]-code and in graphic codes.
Discret. Appl. Math., 2015
Destroying longest cycles in graphs and digraphs.
Discret. Appl. Math., 2015
2014
Group flow, complex flow, unit vector flow, and the (2+ε)-flow conjecture.
J. Comb. Theory, Ser. B, 2014
J. Comb. Theory, Ser. B, 2014
Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces".
Comb., 2014
2013
Decomposing a graph into bistars.
J. Comb. Theory, Ser. B, 2013
Nowhere-zero 3-flows and modulo k-orientations.
J. Comb. Theory, Ser. B, 2013
The maximum number of minimal codewords in an [<i>n</i>, <i>k</i>][n, k]-code.
Discret. Math., 2013
The maximum number of minimal codewords in long codes.
Discret. Appl. Math., 2013
Decomposing graphs into paths of fixed length.
Comb., 2013
2012
The weak 3-flow conjecture and the weak circular flow conjecture.
J. Comb. Theory, Ser. B, 2012
From the plane to higher surfaces.
J. Comb. Theory, Ser. B, 2012
The maximum number of minimal codewords in an $[n,k]-$code
CoRR, 2012
On the Number of Longest and Almost Longest Cycles in Cubic Graphs.
Ars Comb., 2012
2011
Switchings, extensions, and reductions in central digraphs.
J. Comb. Theory, Ser. A, 2011
On the complexity of some colorful problems parameterized by treewidth.
Inf. Comput., 2011
Rainbow Paths with Prescribed Ends.
Electron. J. Comb., 2011
On planarity of compact, locally connected, metric spaces.
Comb., 2011
Grinberg's Criterion Applied to Some Non-Planar Graphs.
Ars Comb., 2011
2009
The chromatic polynomial and list colorings.
J. Comb. Theory, Ser. B, 2009
Decomposing a planar graph of girth 5 into an independent set and a forest.
J. Comb. Theory, Ser. B, 2009
2008
Decompositions of highly connected graphs into paths of length 3.
J. Graph Theory, 2008
On the maximum number of cycles in a planar graph.
J. Graph Theory, 2008
2-List-coloring planar graphs without monochromatic triangles.
J. Comb. Theory, Ser. B, 2008
Graph-like continua, augmenting arcs, and Menger's theorem.
Comb., 2008
2007
Exponentially many 5-list-colorings of planar graphs.
J. Comb. Theory, Ser. B, 2007
Many 3-colorings of triangle-free planar graphs.
J. Comb. Theory, Ser. B, 2007
Hajós' conjecture for line graphs.
J. Comb. Theory, Ser. B, 2007
On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree.
Comb., 2007
2006
A Cantor-Bernstein Theorem for Paths in Graphs.
Am. Math. Mon., 2006
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation.
J. Graph Theory, 2006
Rectangular and visibility representations of infinite planar graphs.
J. Graph Theory, 2006
Edge-disjoint Hamiltonian cycles in hypertournaments.
J. Graph Theory, 2006
Claw-decompositions and tutte-orientations.
J. Graph Theory, 2006
The number of k-colorings of a graph on a fixed surface.
Discret. Math., 2006
Density Conditions For Triangles In Multipartite Graphs.
Comb., 2006
2005
Some remarks on Hajo's' conjecture.
J. Comb. Theory, Ser. B, 2005
2004
Graphs with not all possible path-kernels.
Discret. Math., 2004
Classification Of Locally 2-Connected Compact Metric Spaces.
Comb., 2004
The Locally Connected Compact Metric Spaces Embeddable In The Plane.
Comb., 2004
2003
The chromatic number of a graph of girth 5 on a fixed surface.
J. Comb. Theory, Ser. B, 2003
A short list color proof of Grötzsch's theorem.
J. Comb. Theory, Ser. B, 2003
2002
Long Cycles in Graphs on a Fixed Surface.
J. Comb. Theory, Ser. B, 2002
An intersection graph of straight lines.
Discret. Math., 2002
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree.
Comb., 2002
2001
Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph.
J. Comb. Theory, Ser. B, 2001
Totally Odd <i>K</i><sub>4</sub>-subdivisions in 4-chromatic Graphs.
Comb., 2001
The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity.
Comb., 2001
Johns Hopkins series in the mathematical sciences, Johns Hopkins University Press, ISBN: 978-0-8018-6689-0, 2001
2000
The Rendezvous Number of a Symmetric Matrix and a Compact Connected Metric Space.
Am. Math. Mon., 2000
The color space of a graph.
J. Graph Theory, 2000
Chromatic Roots and Hamiltonian Paths.
J. Comb. Theory, Ser. B, 2000
Coloring triangle-free graphs with fixed size.
Discret. Math., 2000
1999
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5.
J. Comb. Theory, Ser. B, 1999
Highly Connected Sets and the Excluded Grid Theorem.
J. Comb. Theory, Ser. B, 1999
1998
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs.
J. Comb. Theory, Ser. B, 1998
1997
On the Complexity of Finding a Minimum Cycle Cover of a Graph.
SIAM J. Comput., 1997
The Genus Problem for Cubic Graphs.
J. Comb. Theory, Ser. B, 1997
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces.
J. Comb. Theory, Ser. B, 1997
Color-Critical Graphs on a Fixed Surface.
J. Comb. Theory, Ser. B, 1997
Chords of Longest Cycles in Cubic Graphs.
J. Comb. Theory, Ser. B, 1997
On the Number of Cycles in 3-Connected Cubic Graphs.
J. Comb. Theory, Ser. B, 1997
Dirac's conjecture on K<sub>5</sub>-subdivisions.
Discret. Math., 1997
The Zero-Free Intervals for Chromatic Polynomials of Graphs.
Comb. Probab. Comput., 1997
1996
Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs.
J. Comb. Theory, Ser. B, 1996
On the Number of Hamiltonian Cycles in Bipartite Graphs.
Comb. Probab. Comput., 1996
K5-Subdivisions in Graphs.
Comb. Probab. Comput., 1996
1995
3-List-Coloring Planar Graphs of Girth 5.
J. Comb. Theory, Ser. B, 1995
Decomposing a Planar Graph into Degenerate Graphs.
J. Comb. Theory, Ser. B, 1995
Intersections of Curve Systems and the Crossing Number of C<sub>5</sub> X C<sub>5</sub>.
Discret. Comput. Geom., 1995
1994
J. Comb. Theory, Ser. B, 1994
Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane.
J. Comb. Theory, Ser. B, 1994
Every Planar Graph Is 5-Choosable.
J. Comb. Theory, Ser. B, 1994
Five-Coloring Graphs on the Torus.
J. Comb. Theory, Ser. B, 1994
1993
Vertex-Transitive Graphs and Accessibility.
J. Comb. Theory, Ser. B, 1993
Triangulating a Surface with a Prescribed Graph.
J. Comb. Theory, Ser. B, 1993
Five-Coloring Maps on Surfaces.
J. Comb. Theory, Ser. B, 1993
Minimal Graphs with Crossing Number at Least <i>k</i>.
J. Comb. Theory, Ser. B, 1993
The Even Cycle Problem for Planar Digraphs.
J. Algorithms, 1993
1992
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs.
SIAM J. Discret. Math., 1992
Infinite connected graphs with no end-preserving spanning trees.
J. Comb. Theory, Ser. B, 1992
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.
J. Algorithms, 1992
Plane Cubic Graphs with Prescribed Face Areas.
Comb. Probab. Comput., 1992
The Hadwiger number of subgroups vertex-transitive graphs.
Comb., 1992
1991
Kings in k-partite tournaments.
Discret. Math., 1991
Highly connected non-2-linked digraphs.
Comb., 1991
1990
Graphs with homeomorphically irreducible spanning trees.
J. Graph Theory, 1990
Embeddings of graphs with no short noncontractible cycles.
J. Comb. Theory, Ser. B, 1990
Resistances and currents in infinite electrical networks.
J. Comb. Theory, Ser. B, 1990
Bidirectional retracting-free double tracings and upper embeddability of graphs.
J. Comb. Theory, Ser. B, 1990
1989
Tight bounds on the chromatic sum of a connected graph.
J. Graph Theory, 1989
Infinite, highly connected digraphs with no two arc-disjoint spanning trees.
J. Graph Theory, 1989
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs.
J. Comb. Theory, Ser. B, 1989
The Graph Genus Problem is NP-Complete.
J. Algorithms, 1989
1988
Rectilinear drawings of graphs.
J. Graph Theory, 1988
On the presence of disjoint subgraphs of a specified type.
J. Graph Theory, 1988
Arc reversals in tournaments.
Discret. Math., 1988
1987
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number.
J. Graph Theory, 1987
Counterexamples to Adám's conjecture on arc reversals in directed graphs.
J. Comb. Theory, Ser. B, 1987
A characterization of locally finite vertex-transitive graphs.
J. Comb. Theory, Ser. B, 1987
Characterization of even directed graphs.
J. Comb. Theory, Ser. B, 1987
Hamiltonian dicycles avoiding prescribed arcs in tournaments.
Graphs Comb., 1987
On digraphs with no two disjoint directed cycles.
Comb., 1987
1986
Reflections on graph theory.
J. Graph Theory, 1986
Interval representations of planar graphs.
J. Comb. Theory, Ser. B, 1986
Path and cycle sub-ramsey numbers and an edge-colouring conjecture.
Discret. Math., 1986
1985
Subgraphs with large degrees and girth.
Graphs Comb., 1985
Cycles through four edges in 3-connected cubic graphs.
Graphs Comb., 1985
Even Cycles in Directed Graphs.
Eur. J. Comb., 1985
The 2-linkage problem for acyclic digraphs.
Discret. Math., 1985
1984
Subdivisions of graphs with large minimum degree.
J. Graph Theory, 1984
A refinement of Kuratowski's theorem.
J. Comb. Theory, Ser. B, 1984
1983
Graph decomposition with applications to subdivisions and path systems modulo <i>k</i>.
J. Graph Theory, 1983
A theorem on paths in planar graphs.
J. Graph Theory, 1983
Graph decomposition with constraints on the connectivity and minimum degree.
J. Graph Theory, 1983
Deformations of plane graphs.
J. Comb. Theory, Ser. B, 1983
J. Comb. Theory, Ser. B, 1983
Disjoint cycles in digraphs.
Comb., 1983
Cycles in graphs of uncountable chromatic number.
Comb., 1983
1982
Circuits through specified edges.
Discret. Math., 1982
A nine point theorem for 3-connected graphs.
Comb., 1982
1981
A remark on the factor theorems of lovász and tutte.
J. Graph Theory, 1981
Nonseparating cycles in <i>K</i>-Connected graphs.
J. Graph Theory, 1981
Cycles in digraphs- a survey.
J. Graph Theory, 1981
Non-separating induced cycles in graphs.
J. Comb. Theory, Ser. B, 1981
The size of connected hypergraphs with prescribed covering number.
J. Comb. Theory, Ser. B, 1981
Planar cubic hypohamiltonian and hypotraceable graphs.
J. Comb. Theory, Ser. B, 1981
1980
Hamiltonian-connected tournaments.
J. Comb. Theory, Ser. B, 1980
Planarity and duality of finite and infinite graphs.
J. Comb. Theory, Ser. B, 1980
On the number of Hamiltonian cycles in tournaments.
Discret. Math., 1980
1979
On the number of hamiltonian cycles in a maximal planar graph.
J. Graph Theory, 1979
Three-regular subgraphs of four-regular graphs.
J. Graph Theory, 1979
1978
Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs.
J. Graph Theory, 1978
Distances in orientations of graphs.
J. Comb. Theory, Ser. B, 1978
On separating cycles in graphs.
Discret. Math., 1978
Reconstructibility versus edge reconstructibility of infinite graphs.
Discret. Math., 1978
1977
Note on circuits containing specified edges.
J. Comb. Theory, Ser. B, 1977
Counterexamples to the edge reconstruction conjecture for infinite graphs.
Discret. Math., 1977
An ore-type condition implying a digraph to be pancyclic.
Discret. Math., 1977
A short proof of Meyniel's theorem.
Discret. Math., 1977
1976
Planar and infinite hypohamiltonian and hypotraceable graphs.
Discret. Math., 1976
1974
Hypohamiltonian and hypotraceable graphs.
Discret. Math., 1974
On hypohamiltonian graphs.
Discret. Math., 1974
