2024
Am. Math. Mon., September, 2024
2023
2-Reconstructibility of Strongly Regular Graphs and 2-Partially Distance-Regular Graphs.
Graphs Comb., October, 2023
2022
Systems of Overlap Representation for Families of Intervals.
Graphs Comb., 2022
2021
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices.
IEEE Trans. Inf. Theory, 2021
On the Bar Visibility Number of Complete Bipartite Graphs.
SIAM J. Discret. Math., 2021
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree.
Graphs Comb., 2021
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness.
Eur. J. Comb., 2021
3-regular graphs are 2-reconstructible.
Eur. J. Comb., 2021
Cycles in Color-Critical Graphs.
Electron. J. Comb., 2021
2020
Problems and Solutions (with the collaboration of Paul Bracken, Ezra A. Brown Zachary Franco Christian Friesen László Lipták Rick Luttmann Frank B. Miles Lenhard Ng Kenneth Stolarsky Richard Stong Stan Wagon Lawrence Washington Elizabeth Wilmer Fuzhen Zhang and Li Zhou).
Am. Math. Mon., 2020
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices.
Graphs Comb., 2020
Upper bounds for bar visibility of subgraphs and n-vertex graphs.
Discret. Appl. Math., 2020
Lichiardopol's Conjecture on Disjoint Cycles in Tournaments.
Electron. J. Comb., 2020
Strongly connectable digraphs and non-transitive dice.
AKCE Int. J. Graphs Comb., 2020
2019
Reconstruction from the deck of -vertex induced subgraphs.
J. Graph Theory, 2019
Ramsey Numbers of Interval 2-Chromatic Ordered Graphs.
Graphs Comb., 2019
Largest 2-Regular Subgraphs in 3-Regular Graphs.
Graphs Comb., 2019
Extensions of matroid covering and packing.
Eur. J. Comb., 2019
Antipodal edge-colorings of hypercubes.
Discuss. Math. Graph Theory, 2019
Online sum-paintability: Slow-coloring of trees.
Discret. Appl. Math., 2019
Extremal problems on saturation for the family of k-edge-connected graphs.
Discret. Appl. Math., 2019
The unit acquisition number of a graph.
Discret. Appl. Math., 2019
2018
Fractional and circular separation dimension of graphs.
Eur. J. Comb., 2018
Randomly twisted hypercubes.
Eur. J. Comb., 2018
Online sum-paintability: The slow-coloring game.
Discret. Math., 2018
2017
The vulnerability of the diameter of the enhanced hypercubes.
Theor. Comput. Sci., 2017
Uniquely Cycle-Saturated Graphs.
J. Graph Theory, 2017
Minimum Degree and Dominating Paths.
J. Graph Theory, 2017
The Game Saturation Number of a Graph.
J. Graph Theory, 2017
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.
J. Comb. Theory B, 2017
Bar Visibility Numbers for Hypercubes and Outerplanar Digraphs.
Graphs Comb., 2017
An introduction to the discharging method via graph coloring.
Discret. Math., 2017
2016
To catch a falling robber.
Theor. Comput. Sci., 2016
Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees.
J. Graph Theory, 2016
Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number.
Graphs Comb., 2016
Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs.
Graphs Comb., 2016
A new proof that 4-connected planar graphs are Hamiltonian-connected.
Discuss. Math. Graph Theory, 2016
Extremal problems for degree-based topological indices.
Discret. Appl. Math., 2016
On r-dynamic coloring of graphs.
Discret. Appl. Math., 2016
Spanning Trees in 2-trees.
CoRR, 2016
2015
The adversary degree-associated reconstruction number of double-brooms.
J. Discrete Algorithms, 2015
Sum-Paintability of Generalized Theta-Graphs.
Graphs Comb., 2015
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices.
Eur. J. Comb., 2015
Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs.
Discret. Appl. Math., 2015
On r-dynamic coloring of grids.
Discret. Appl. Math., 2015
Sharp lower bounds on the fractional matching number.
Discret. Appl. Math., 2015
2014
Linear Discrepancy of Chain Products and Posets with Bounded Degree.
Order, 2014
The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs.
Discuss. Math. Graph Theory, 2014
Cutwidth of triangular grids.
Discret. Math., 2014
Permutation bigraphs and interval containments.
Discret. Appl. Math., 2014
Equicovering Subgraphs of Graphs and Hypergraphs.
Electron. J. Comb., 2014
2013
Total Acquisition in Graphs.
SIAM J. Discret. Math., 2013
Extremal Problems for Game Domination Number.
SIAM J. Discret. Math., 2013
Visibility Number of Directed Graphs.
SIAM J. Discret. Math., 2013
Bounds on the k-dimension of Products of Special Posets.
Order, 2013
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree.
J. Graph Theory, 2013
Extremal Graphs With a Given Number of Perfect Matchings.
J. Graph Theory, 2013
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond.
Electron. Notes Discret. Math., 2013
Degree Ramsey numbers for cycles and blowups of trees.
Eur. J. Comb., 2013
Rainbow edge-coloring and rainbow domination.
Discret. Math., 2013
Acquisition-extremal graphs.
Discret. Appl. Math., 2013
Game matching number of graphs.
Discret. Appl. Math., 2013
Beyond Ohba's Conjecture: A bound on the choice number of <i>k</i>-chromatic graphs with <i>n</i> vertices.
CoRR, 2013
Extensions to 2-Factors in Bipartite Graphs.
Electron. J. Comb., 2013
2012
Locating a robber on a graph via distance queries.
Theor. Comput. Sci., 2012
Revolutionaries and spies: Spy-good and spy-bad graphs.
Theor. Comput. Sci., 2012
Spanning Cycles Through Specified Edges in Bipartite Graphs.
J. Graph Theory, 2012
Overlap number of graphs.
J. Graph Theory, 2012
Packing of graphic <i>n</i>-tuples.
J. Graph Theory, 2012
The <i>A</i>4-structure of a graph.
J. Graph Theory, 2012
Packing of Steiner trees and S-connectors in graphs.
J. Comb. Theory B, 2012
Cycle spectra of Hamiltonian graphs.
J. Comb. Theory B, 2012
Connected Domination Number of a Graph and its Complement.
Graphs Comb., 2012
Uniquely C 4-Saturated Graphs.
Graphs Comb., 2012
Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps.
Discret. Math., 2012
Degree Ramsey Numbers of Graphs.
Comb. Probab. Comput., 2012
2011
Longest cycles in k-connected graphs with given independence number.
J. Comb. Theory B, 2011
A short proof of the Berge-Tutte Formula and the Gallai-Edmonds Structure Theorem.
Eur. J. Comb., 2011
Matching and edge-connectivity in regular graphs.
Eur. J. Comb., 2011
Revolutionaries and spies on trees and unicyclic graphs
CoRR, 2011
Acyclic Sets in <i>k</i>-Majority Tournaments.
Electron. J. Comb., 2011
Equitable Hypergraph Orientations.
Electron. J. Comb., 2011
On-line Ramsey Theory for Bounded Degree Graphs.
Electron. J. Comb., 2011
A new proof of 3-colorability of Eulerian triangulations.
Ars Math. Contemp., 2011
2010
Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree.
J. Graph Theory, 2010
Oriented diameter of graphs with diameter 3.
J. Comb. Theory B, 2010
Forbidden subposets for fractional weak discrepancy at most k.
Eur. J. Comb., 2010
A short constructive proof of the Erdos-Gallai characterization of graphic lists.
Discret. Math., 2010
Decomposition of sparse graphs, with application to game coloring number.
Discret. Math., 2010
Degree-associated reconstruction number of graphs.
Discret. Math., 2010
Rainbow Matching in Edge-Colored Graphs.
Electron. J. Comb., 2010
The Edge-Count Criterion for Graphic Lists.
Electron. J. Comb., 2010
2009
On the Pagenumber of k-Trees.
SIAM J. Discret. Math., 2009
Matching Extendability in Hypercubes.
SIAM J. Discret. Math., 2009
Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable.
SIAM J. Discret. Math., 2009
Extremal Problems for Roman Domination.
SIAM J. Discret. Math., 2009
Implications among linkage properties in graphs.
J. Graph Theory, 2009
Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs.
J. Graph Theory, 2009
Independence Number of 2-Factor-Plus-Triangles Graphs.
Electron. J. Comb., 2009
Chromatic Number for a Generalization of Cartesian Product Graphs.
Electron. J. Comb., 2009
Repetition Number of Graphs.
Electron. J. Comb., 2009
2008
Long Local Searches for Maximal Bipartite Subgraphs.
SIAM J. Discret. Math., 2008
Duality for Semiantichains and Unichain Coverings in Products of Special Posets.
Order, 2008
Circular chromatic index of Cartesian products of graphs.
J. Graph Theory, 2008
Pebbling and optimal pebbling in graphs.
J. Graph Theory, 2008
The hub number of a graph.
Inf. Process. Lett., 2008
Triangle-free planar graphs with minimum degree 3 have radius at least 3.
Discuss. Math. Graph Theory, 2008
Tree-Thickness and Caterpillar-Thickness under Girth Constraints.
Electron. J. Comb., 2008
Optimal strong parity edge-coloring of complete graphs.
Comb., 2008
2007
Improved Bounds on Families Under <i>k</i> -wise Set-Intersection Constraints.
Graphs Comb., 2007
Editorial Announcement: Hello, World.
Discret. Math., 2007
Research problems from the 5th Slovenian Conference (Bled, 2003).
Discret. Math., 2007
Short proofs for cut-and-paste sorting of permutations.
Discret. Math., 2007
2006
Extending precolorings to circular colorings.
J. Comb. Theory B, 2006
Chvátal's Condition cannot hold for both a graph and its complement.
Discuss. Math. Graph Theory, 2006
2005
Nordhaus-Gaddum-type Theorems for decompositions into many parts.
J. Graph Theory, 2005
Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem.
Comb., 2005
2004
Adjacency Matrices That Are Incidence Matrices: 10967.
Am. Math. Mon., 2004
The Bar Visibility Number of a Graph.
SIAM J. Discret. Math., 2004
Precoloring Extensions of Brooks' Theorem.
SIAM J. Discret. Math., 2004
Homomorphisms from sparse graphs with large girth.
J. Comb. Theory B, 2004
On Pattern Ramsey Numbers of Graphs.
Graphs Comb., 2004
Interval numbers of powers of block graph.
Discret. Math., 2004
Graphic and Protographic Lists of Integers.
Electron. J. Comb., 2004
2003
A list analogue of equitable coloring.
J. Graph Theory, 2003
Isometric cycles, cutsets, and crowning of bridged graphs.
J. Graph Theory, 2003
Probabilistic Methods for Decomposition Dimension of Graphs.
Graphs Comb., 2003
On the existence of Hamiltonian paths in the cover graph of <i>M(n)</i>.
Discret. Math., 2003
On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle.
Comb. Probab. Comput., 2003
2002
The Chromatic Spectrum of Mixed Hypergraphs.
Graphs Comb., 2002
Maximum Face-Constrained Coloring of Plane Graphs.
Electron. Notes Discret. Math., 2002
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees.
Electron. Notes Discret. Math., 2002
On restricted edge-colorings of bicliques.
Discret. Math., 2002
A Fibonacci tiling of the plane.
Discret. Math., 2002
A Proof of the Two-path Conjecture.
Electron. J. Comb., 2002
2001
Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs.
SIAM J. Discret. Math., 2001
Ramsey Theory and Bandwidth of Graphs.
Graphs Comb., 2001
Realizing degree imbalances in directed graphs.
Discret. Math., 2001
2000
Correction to Edge-Bandwidth of Graphs.
SIAM J. Discret. Math., 2000
Connected Domination and Spanning Trees with Many Leaves.
SIAM J. Discret. Math., 2000
Multiple vertex coverings by specified induced subgraphs.
J. Graph Theory, 2000
The edge-bandwidth of theta graphs.
J. Graph Theory, 2000
On the Number of Vertices with Specified Eccentricity.
Graphs Comb., 2000
A note on generalized chromatic number and generalized girth.
Discret. Math., 2000
Perfection thickness of graphs.
Discret. Math., 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Edge-Bandwidth of Graphs.
SIAM J. Discret. Math., 1999
Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs.
SIAM J. Comput., 1999
Intersection representation of digraphs in trees with few leaves.
J. Graph Theory, 1999
Coloring of trees with minimum sum of colors.
J. Graph Theory, 1999
Chromatic spectrum is broken.
Electron. Notes Discret. Math., 1999
A short proof that 'proper = unit'.
Discret. Math., 1999
1998
Star-factors of tournaments.
J. Graph Theory, 1998
The leafage of a chordal graph.
Discuss. Math. Graph Theory, 1998
Short proofs for interval digraphs.
Discret. Math., 1998
Line digraphs and coreflexive vertex sets.
Discret. Math., 1998
Bandwidth and density for block graphs.
Discret. Math., 1998
1997
Total interval number for graphs with bounded degree.
J. Graph Theory, 1997
The Number of Dependent Arcs in an Acyclic Orientation.
J. Comb. Theory B, 1997
Optimal Structural Diagnosis of Wiring Networks.
Proceedings of the Digest of Papers: FTCS-27, 1997
1996
The Total Interval Number of a Graph II: Trees and Complexity.
SIAM J. Discret. Math., 1996
Large 2P<sub>3</sub>-free graphs with bounded degree.
Discret. Math., 1996
1995
A Graph-Theoretic Game and Its Application to the k-Server Problem.
SIAM J. Comput., 1995
Maximum Bandwidth Under Edge Addition.
J. Graph Theory, 1995
The 2-intersection number of paths and bounded-degree trees.
J. Graph Theory, 1995
Acyclic orientations of complete bipartite graphs.
Discret. Math., 1995
Representing digraphs using intervals or circular arcs.
Discret. Math., 1995
Interval number of special posets and random posets.
Discret. Math., 1995
Optimal Algorithms for Finding Connected Components of an Unknown Graph.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
Covering a Poset by Interval Orders.
J. Comb. Theory A, 1994
Relaxed chromatic numbers of graphs.
Graphs Comb., 1994
Size, chromatic number, and connectivity.
Graphs Comb., 1994
The <i>p</i>-Intersection Number of a Complete Bipartite Graph and Orthogonal Double Coverings of a Clique.
Comb., 1994
1993
Large <i>P</i><sub>4</sub>-free graphs with bounded degree.
J. Graph Theory, 1993
Generating Linear Extensions by Adjacent Transpositions.
J. Comb. Theory B, 1993
The total interval number of a graph, I: Fundamental classes.
Discret. Math., 1993
Subtree and Substar Intersection Numbers.
Discret. Appl. Math., 1993
Clique coverings of the edges of a random graph.
Comb., 1993
1992
Large regular graphs with no induced 2<i>K</i><sub>2</sub>.
Graphs Comb., 1992
1991
Spanning Trees with Many Leaves.
SIAM J. Discret. Math., 1991
The interval inclusion number of a partially ordered set.
Discret. Math., 1991
The maximum number of winning 2-sets.
Discret. Appl. Math., 1991
Vertex Degrees in Planar Graphs.
Proceedings of the Planar Graphs, 1991
A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract).
Proceedings of the On-Line Algorithms, 1991
1990
Tetrahedrizing Point Sets in Three Dimensions.
J. Symb. Comput., 1990
1989
Circular-arc digraphs: A characterization.
J. Graph Theory, 1989
Interval digraphs: An analogue of interval graphs.
J. Graph Theory, 1989
A length-width inequality for partially ordered sets with two-element cutsets.
J. Comb. Theory B, 1989
A short proof of the degree bound for interval number.
Discret. Math., 1989
1988
On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports.
IEEE Trans. Computers, 1988
Pagenumber of complete bipartite graphs.
J. Graph Theory, 1988
Election in a Complete Network with a Sense of Direction.
Inf. Process. Lett., 1988
The addition game: an abstraction of a communication problem.
Discret. Math., 1988
1987
An improved edge bound on the interval number of a graph.
J. Graph Theory, 1987
Sorting by insertion of leading elements.
J. Comb. Theory A, 1987
Unichain coverings in partial orders with the nested saturation property.
Discret. Math., 1987
Poset boxicity of graphs.
Discret. Math., 1987
Two easy duality theorems for product partial orders.
Discret. Appl. Math., 1987
1986
"Poly-unsaturated" posets: The Greene-Kleitman theorem is best possible.
J. Comb. Theory A, 1986
1985
Decomposition of product graphs into complete bipartite subgraphs.
Discret. Math., 1985
A note on the interval number of a graph.
Discret. Math., 1985
1984
Recognizing graphs with fixed interval number is NP-complete.
Discret. Appl. Math., 1984
The interval number of a complete multipartite graph.
Discret. Appl. Math., 1984
Regressions and monotone chains: a ramsey - type extermal problem for partial orders.
Comb., 1984
1983
Some Remarks on Normalized Matching.
J. Comb. Theory A, 1983
The interval number of a planar graph: Three intervals suffice.
J. Comb. Theory B, 1983
1982
A class of solutions to the gossip problem, part III.
Discret. Math., 1982
A class of solutions to the gossip problem, part II.
Discret. Math., 1982
A class of solutions to the gossip problem, part I.
Discret. Math., 1982
1980
Extremal Values of the Interval Number of a Graph.
SIAM J. Algebraic Discret. Methods, 1980
A Symmetric Chain Decomposition of L(4, n).
Eur. J. Comb., 1980
1979
The Number of Meets between Two Subsets of a Lattice.
J. Comb. Theory A, 1979
Skew chain orders and sets of rectangles.
Discret. Math., 1979
