| Publication | Date of Publication | Type |
|---|
The circumference of 2-tough graphs
Discrete Applied Mathematics | 2026-06-12 | Paper |
| Euler's formula for general graph embeddings | 2026-04-29 | Paper |
A generalization of a theorem of Nash-Williams
Graphs and Combinatorics | 2022-11-29 | Paper |
On the necessity of Chvátal's Hamiltonian degree condition
AKCE International Journal of Graphs and Combinatorics | 2021-09-01 | Paper |
Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
Graphs and Combinatorics | 2017-12-12 | Paper |
| Best monotone degree condition for 1-binding graphs to contain a 1-factor | 2017-04-04 | Paper |
Vertex arboricity and vertex degrees
Graphs and Combinatorics | 2016-11-29 | Paper |
Orienting graphs to optimize reachability
Information Processing Letters | 2016-06-01 | Paper |
Best monotone degree conditions for binding number and cycle structure
Discrete Applied Mathematics | 2015-09-21 | Paper |
Best monotone degree conditions for graph properties: a survey
Graphs and Combinatorics | 2015-01-20 | Paper |
Toughness and binding number
Discrete Applied Mathematics | 2014-05-05 | Paper |
| scientific article; zbMATH DE number 6277704 (Why is no real title available?) | 2014-04-02 | Paper |
Toughness and vertex degrees
Journal of Graph Theory | 2013-03-07 | Paper |
Degree sequences and the existence of k-factors
Graphs and Combinatorics | 2012-12-27 | Paper |
Binding number, minimum degree, and cycle structure in graphs
Journal of Graph Theory | 2012-09-12 | Paper |
Best monotone degree conditions for binding number
Discrete Mathematics | 2011-10-21 | Paper |
| Long cycles in 2-connected triangle-free graphs | 2011-02-02 | Paper |
Sufficient degree conditions for k-edge-connectedness of a graph
Networks | 2010-11-24 | Paper |
| Subdivision of edges and matching size. | 2010-06-15 | Paper |
| scientific article; zbMATH DE number 5532153 (Why is no real title available?) | 2009-03-24 | Paper |
Tutte sets in graphs I: Maximal tutte sets and D-graphs
Journal of Graph Theory | 2007-08-09 | Paper |
Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
Discrete Applied Mathematics | 2007-06-26 | Paper |
Toughness in graphs -- a survey
Graphs and Combinatorics | 2006-06-16 | Paper |
| scientific article; zbMATH DE number 2230266 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2230305 (Why is no real title available?) | 2005-11-18 | Paper |
Improved bounds for the chromatic number of a graph
Journal of Graph Theory | 2005-02-16 | Paper |
Toughness, minimum degree, and spanning cubic subgraphs
Journal of Graph Theory | 2004-03-15 | Paper |
Bounds for the chromatic number of graphs with partial information
Discrete Mathematics | 2003-04-09 | Paper |
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
Discrete Applied Mathematics | 2002-08-29 | Paper |
| Locations on time-varying networks | 2001-07-09 | Paper |
A note on the road-coloring conjecture
Ars Combinatoria | 2001-06-10 | Paper |
Short proofs of theorems of Nash-Williams and Tutte
Ars Combinatoria | 2001-06-10 | Paper |
| scientific article; zbMATH DE number 1472146 (Why is no real title available?) | 2000-10-23 | Paper |
| Improved bounds for the chromatic index of graphs and multigraphs | 2000-04-09 | Paper |
On the cost chromatic number of outerplanar, planar, and line graphs
Discussiones Mathematicae Graph Theory | 1998-11-08 | Paper |
The complexity of recognizing tough cubic graphs
Discrete Applied Mathematics | 1998-01-07 | Paper |
| Locating replicas of a database on a network | 1997-09-21 | Paper |
| 2-factors in triangle-free graphs | 1997-06-29 | Paper |
A note on dominating cycles in 2-connected graphs
Discrete Mathematics | 1997-06-22 | Paper |
Gossiping with multiple sends and receives
Discrete Applied Mathematics | 1997-05-20 | Paper |
Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem''
Operations Research Letters | 1996-08-01 | Paper |
| scientific article; zbMATH DE number 861394 (Why is no real title available?) | 1996-05-19 | Paper |
| scientific article; zbMATH DE number 867682 (Why is no real title available?) | 1996-04-21 | Paper |
| scientific article; zbMATH DE number 866663 (Why is no real title available?) | 1996-04-17 | Paper |
| scientific article; zbMATH DE number 861438 (Why is no real title available?) | 1996-03-28 | Paper |
Star arboricity of graphs
Discrete Mathematics | 1996-03-25 | Paper |
| scientific article; zbMATH DE number 841562 (Why is no real title available?) | 1996-02-06 | Paper |
Toughness and triangle-free graphs
Journal of Combinatorial Theory. Series B | 1996-01-29 | Paper |
Degree‐bounded coloring of graphs: Variations on a theme by brooks
Journal of Graph Theory | 1995-10-31 | Paper |
Gale's Round-Trip Jeep Problem
The American Mathematical Monthly | 1995-09-17 | Paper |
Fitting polygonal functions to a set of points in the plane
CVGIP: Graphical Models and Image Processing | 1995-03-09 | Paper |
Toughness, minimum degree, and the existence of 2‐factors
Journal of Graph Theory | 1994-09-11 | Paper |
Parallel Information Dissemination by Packets
SIAM Journal on Computing | 1994-05-10 | Paper |
On the complexity of recognizing tough graphs
Discrete Mathematics | 1994-03-10 | Paper |
Approximation algorithms for the capacitated plant allocation problem
Operations Research Letters | 1994-01-01 | Paper |
On locating path- or tree-shaped facilities on networks
Networks | 1993-12-12 | Paper |
| scientific article; zbMATH DE number 434902 (Why is no real title available?) | 1993-11-11 | Paper |
The Voronoi Partition of a Network and Its Implications in Location Theory
ORSA Journal on Computing | 1993-02-25 | Paper |
Sequential information dissemination by packets
Networks | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 68344 (Why is no real title available?) | 1992-10-06 | Paper |
On felicitous graphs
Discrete Mathematics | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 26309 (Why is no real title available?) | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 19172 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 19203 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 15502 (Why is no real title available?) | 1992-06-25 | Paper |
Long cycles in graphs with large degree sums
Discrete Mathematics | 1990-01-01 | Paper |
Hamiltonian degree conditions which imply a graph is pancyclic
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
Recognizing tough graphs is NP-hard
Discrete Applied Mathematics | 1990-01-01 | Paper |
A simple proof of a theorem of Jung
Discrete Mathematics | 1990-01-01 | Paper |
Parallel algorithms for gossiping by mail
Information Processing Letters | 1990-01-01 | Paper |
A Note on the Vertex Arboricity of a Graph
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4093495 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4106890 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4104998 (Why is no real title available?) | 1988-01-01 | Paper |
A cycle structure theorem for Hamiltonian graphs
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
Chromatic factorizations of a graph
Journal of Graph Theory | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4127256 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3924825 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3902696 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3877220 (Why is no real title available?) | 1985-01-01 | Paper |
An adaptive algorithm for system level diagnosis
Journal of Algorithms | 1984-01-01 | Paper |
On the maximum number of independent edges in cubic graphs
Discrete Mathematics | 1982-01-01 | Paper |
Bipartite graphs with cycles of all even lengths
Journal of Graph Theory | 1982-01-01 | Paper |
The basis number of the \(n\)-cube
Journal of Combinatorial Theory. Series B | 1982-01-01 | Paper |
Bounds on the number of cycles of length three in a planar graph
Israel Journal of Mathematics | 1982-01-01 | Paper |
The basis number of a graph
Journal of Combinatorial Theory. Series B | 1981-01-01 | Paper |
The number of triangles in a triangulation of a set of points in the plane
Elemente der Mathematik | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3760202 (Why is no real title available?) | 1979-01-01 | Paper |
On the number of cycles of lengthk in a maximal planar graph
Journal of Graph Theory | 1979-01-01 | Paper |
On the number of hamiltonian cycles in a maximal planar graph
Journal of Graph Theory | 1979-01-01 | Paper |
Connectivity, genus, and the number of components in vertex-deleted subgraphs
Journal of Combinatorial Theory. Series B | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3588696 (Why is no real title available?) | 1978-01-01 | Paper |
On the connectivity of maximal planar graphs
Journal of Graph Theory | 1978-01-01 | Paper |
Systematic searches for hypohamiltonian graphs
Networks | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3616479 (Why is no real title available?) | 1977-01-01 | Paper |
New flip-flop constructions for hypohamiltonian graphs
Discrete Mathematics | 1977-01-01 | Paper |
On Planar Graphical Degree Sequences
SIAM Journal on Applied Mathematics | 1977-01-01 | Paper |
A note on the edge reconstruction conjecture
Bulletin of the Australian Mathematical Society | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3422422 (Why is no real title available?) | 1974-01-01 | Paper |
Pancyclic graphs and a conjecture of Bondy and Chvatal
Journal of Combinatorial Theory. Series B | 1974-01-01 | Paper |
