| Publication | Date of Publication | Type |
|---|
| Optimal algorithms for finding connected components of an unknown graph | 2023-12-12 | Paper |
| 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs | 2023-08-21 | Paper |
| Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable | 2023-08-08 | Paper |
| Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible | 2023-07-19 | Paper |
| Another Proof of the Generalized Tutte--Berge Formula for $f$-Bounded Subgraphs | 2023-07-03 | Paper |
| Bounds for eccentricity-based parameters of graphs | 2023-04-23 | Paper |
| \(3\)-reconstructibility of rooted trees | 2023-04-05 | Paper |
| Sharp lower bounds for the number of maximum matchings in bipartite multigraphs | 2022-11-18 | Paper |
| $2$-Reconstructibility of Weakly Distance-Regular Graphs | 2022-10-21 | Paper |
| Cycles in color-critical graphs | 2022-04-04 | Paper |
| Systems of overlap representation for families of intervals | 2022-03-15 | Paper |
| On the Bar Visibility Number of Complete Bipartite Graphs | 2021-10-18 | Paper |
| Strongly connectable digraphs and non-transitive dice | 2021-10-05 | Paper |
| Some new results on bar visibility of digraphs | 2021-08-26 | Paper |
| On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices | 2021-07-23 | Paper |
| The slow-coloring game on sparse graphs: \(k\)-degenerate, planar, and outerplanar | 2021-07-23 | Paper |
| Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable | 2021-03-22 | Paper |
| Cut-edges and regular factors in regular graphs of odd degree | 2021-03-17 | Paper |
| 3-regular graphs are 2-reconstructible | 2021-02-08 | Paper |
| On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness | 2021-02-08 | Paper |
| Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs | 2020-06-29 | Paper |
| Lichiardopol's conjecture on disjoint cycles in tournaments | 2020-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110817 | 2020-05-25 | Paper |
| Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices | 2020-04-30 | Paper |
| The Number of Perfect Matchings in M\"obius Ladders and Prisms | 2020-03-21 | Paper |
| Ramsey numbers of interval 2-chromatic ordered graphs | 2019-11-06 | Paper |
| Largest 2-regular subgraphs in 3-regular graphs | 2019-06-28 | Paper |
| Online sum-paintability: slow-coloring of trees | 2019-05-23 | Paper |
| Extremal problems on saturation for the family of $k$-edge-connected graphs | 2019-05-03 | Paper |
| Reconstruction from the deck of ‐vertex induced subgraphs | 2019-04-25 | Paper |
| The unit acquisition number of a graph | 2019-03-22 | Paper |
| Extensions of matroid covering and packing | 2018-12-20 | Paper |
| Antipodal edge-colorings of hypercubes | 2018-12-05 | Paper |
| Randomly twisted hypercubes | 2018-04-25 | Paper |
| Online sum-paintability: the slow-coloring game | 2018-02-23 | Paper |
| Decomposition of regular hypergraphs | 2018-01-15 | Paper |
| Fractional and circular separation dimension of graphs | 2017-12-21 | Paper |
| The vulnerability of the diameter of the enhanced hypercubes | 2017-09-12 | Paper |
| The Game Saturation Number of a Graph | 2017-07-05 | Paper |
| Uniquely Cycle‐Saturated Graphs | 2017-06-30 | Paper |
| Bar visibility numbers for hypercubes and outerplanar digraphs | 2017-06-29 | Paper |
| Degree-associated reconstruction parameters of complete multipartite graphs and their complements | 2017-03-09 | Paper |
| An introduction to the discharging method via graph coloring | 2017-02-06 | Paper |
| Minimum Degree and Dominating Paths | 2017-02-01 | Paper |
| Circular chromatic Ramsey number | 2017-01-10 | Paper |
| Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) | 2016-11-25 | Paper |
| Coloring, sparseness and girth | 2016-09-15 | Paper |
| Reconstruction from $k$-decks for graphs with maximum degree 2 | 2016-09-01 | Paper |
| A new proof that 4-connected planar graphs are Hamiltonian-connected | 2016-07-13 | Paper |
| Rainbow spanning subgraphs of small diameter in edge-colored complete graphs | 2016-06-13 | Paper |
| Cubic graphs with large ratio of independent domination number to domination number | 2016-06-13 | Paper |
| Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees | 2016-06-10 | Paper |
| On \(r\)-dynamic coloring of graphs | 2016-05-02 | Paper |
| To catch a falling robber | 2016-04-01 | Paper |
| Extremal problems for degree-based topological indices | 2016-03-18 | Paper |
| Ordered Ramsey theory and track representations of graphs | 2015-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2951140 | 2015-10-09 | Paper |
| Sum-paintability of generalized theta-graphs | 2015-09-24 | Paper |
| The adversary degree-associated reconstruction number of double-brooms | 2015-08-18 | Paper |
| Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs | 2015-07-06 | Paper |
| Sharp lower bounds on the fractional matching number | 2015-05-22 | Paper |
| On \(r\)-dynamic coloring of grids | 2015-05-22 | Paper |
| The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs | 2014-11-18 | Paper |
| Linear discrepancy of chain products and posets with bounded degree | 2014-10-31 | Paper |
| Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices | 2014-10-08 | Paper |
| Equicovering subgraphs of graphs and hypergraphs | 2014-09-04 | Paper |
| Permutation bigraphs and interval containments | 2014-08-26 | Paper |
| Extensions to 2-factors in bipartite graphs | 2014-08-14 | Paper |
| Cutwidth of triangular grids | 2014-08-08 | Paper |
| Circular \((5,2)\)-coloring of sparse graphs | 2014-06-13 | Paper |
| Decomposition of Cartesian products of regular graphs into isomorphic trees | 2014-05-13 | Paper |
| Three topics in online list coloring | 2014-04-30 | Paper |
| Game matching number of graphs | 2014-04-22 | Paper |
| Acquisition-extremal graphs | 2014-04-16 | Paper |
| Total Acquisition in Graphs | 2014-04-10 | Paper |
| Extremal Problems for Game Domination Number | 2014-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405504 | 2014-04-02 | Paper |
| Visibility Number of Directed Graphs | 2014-01-21 | Paper |
| Rainbow edge-coloring and rainbow domination | 2013-12-06 | Paper |
| Bounds on the \(k\)-dimension of products of special posets | 2013-11-22 | Paper |
| Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree | 2013-11-15 | Paper |
| Extremal Graphs With a Given Number of Perfect Matchings | 2013-07-31 | Paper |
| Multicolor on-line degree Ramsey numbers of trees | 2013-07-12 | Paper |
| Chain-making games in grid-like posets | 2013-06-25 | Paper |
| Revolutionaries and spies on trees and unicyclic graphs | 2013-02-28 | Paper |
| Revolutionaries and spies: spy-good and spy-bad graphs | 2013-01-07 | Paper |
| Locating a robber on a graph via distance queries | 2013-01-07 | Paper |
| Uniquely \(C _{4}\)-saturated graphs | 2012-12-27 | Paper |
| Degree Ramsey numbers for cycles and blowups of trees | 2012-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3166002 | 2012-10-21 | Paper |
| Spanning Cycles Through Specified Edges in Bipartite Graphs | 2012-09-12 | Paper |
| The A4-structure of a graph | 2012-09-12 | Paper |
| Cycle spectra of Hamiltonian graphs | 2012-08-14 | Paper |
| Overlap number of graphs | 2012-06-04 | Paper |
| Packing of graphic n-tuples | 2012-06-04 | Paper |
| Degree Ramsey Numbers of Graphs | 2012-05-14 | Paper |
| Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps | 2012-04-30 | Paper |
| Packing of Steiner trees and \(S\)-connectors in graphs | 2012-03-19 | Paper |
| A new proof of 3-colorability of Eulerian triangulations | 2012-03-07 | Paper |
| Connected domination number of a graph and its complement | 2012-01-24 | Paper |
| Problems and Solutions | 2011-12-28 | Paper |
| Longest cycles in \(k\)-connected graphs with given independence number | 2011-12-08 | Paper |
| Problems and Solutions | 2011-11-21 | Paper |
| A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem | 2011-10-24 | Paper |
| On-line Ramsey theory for bounded degree graphs | 2011-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3015590 | 2011-07-13 | Paper |
| Acyclic sets in \(k\)-majority tournaments | 2011-06-24 | Paper |
| Equitable hypergraph orientations | 2011-06-01 | Paper |
| Matching and edge-connectivity in regular graphs | 2011-01-07 | Paper |
| The edge-count criterion for graphic lists | 2010-12-16 | Paper |
| Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree | 2010-11-10 | Paper |
| Forbidden subposets for fractional weak discrepancy at most \(k\) | 2010-10-22 | Paper |
| Degree-associated reconstruction number of graphs | 2010-10-18 | Paper |
| On the Pagenumber of k-Trees | 2010-08-27 | Paper |
| Matching Extendability in Hypercubes | 2010-08-27 | Paper |
| Extremal Problems for Roman Domination | 2010-08-27 | Paper |
| Rainbow matching in edge-colored graphs | 2010-06-16 | Paper |
| The hub number of a graph | 2010-06-09 | Paper |
| Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable | 2010-06-01 | Paper |
| Decomposition of sparse graphs, with application to game coloring number | 2010-05-05 | Paper |
| A short constructive proof of the Erdős-Gallai characterization of graphic lists | 2010-04-27 | Paper |
| Oriented diameter of graphs with diameter 3 | 2010-04-21 | Paper |
| Chromatic number for a generalization of Cartesian product graphs | 2010-03-26 | Paper |
| Optimal strong parity edge-coloring of complete graphs | 2009-12-28 | Paper |
| Long Local Searches for Maximal Bipartite Subgraphs | 2009-08-20 | Paper |
| Triangle-free planar graphs with minimum degree 3 have radius at least 3 | 2009-06-23 | Paper |
| Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs | 2009-06-16 | Paper |
| Implications among linkage properties in graphs | 2009-06-16 | Paper |
| Duality for semiantichains and unichain coverings in products of special posets | 2009-04-24 | Paper |
| Tree-thickness and caterpillar-thickness under girth constraints | 2009-04-07 | Paper |
| Repetition number of graphs | 2009-04-07 | Paper |
| Independence number of 2-factor-plus-triangles graphs | 2009-04-07 | Paper |
| Circular chromatic index of Cartesian products of graphs | 2008-11-19 | Paper |
| Pebbling and optimal pebbling in graphs | 2008-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5443201 | 2008-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5443247 | 2008-02-20 | Paper |
| Research problems from the 20th British Combinatorial Conference | 2008-02-14 | Paper |
| Short proofs for cut-and-paste sorting of permutations | 2007-11-27 | Paper |
| Improved bounds on families under \(k\)-wise set-intersection constraints | 2007-10-11 | Paper |
| Editorial Announcement: Hello, World | 2007-09-21 | Paper |
| Research problems from the 5th Slovenian Conference (Bled, 2003) | 2007-02-13 | Paper |
| Chvátal's Condition cannot hold for both a graph and its complement | 2006-10-16 | Paper |
| Extending precolorings to circular colorings | 2006-07-12 | Paper |
| Hypergraph extension of the Alon-Tarsi list coloring theorem | 2006-01-26 | Paper |
| Nordhaus–Gaddum‐type Theorems for decompositions into many parts | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708587 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708606 | 2005-11-18 | Paper |
| The Bar Visibility Number of a Graph | 2005-09-16 | Paper |
| Precoloring Extensions of Brooks' Theorem | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5311854 | 2005-08-29 | Paper |
| On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle | 2005-03-08 | Paper |
| On pattern Ramsey numbers of graphs | 2005-01-20 | Paper |
| Homomorphisms from sparse graphs with large girth. | 2004-03-15 | Paper |
| Probabilistic methods for decomposition dimension of graphs | 2004-03-04 | Paper |
| Graphic and protographic lists of integers | 2004-02-05 | Paper |
| A list analogue of equitable coloring | 2004-02-03 | Paper |
| Interval numbers of powers of block graphs | 2004-02-02 | Paper |
| Edge-colorings of complete graphs that avoid polychromatic trees | 2004-01-26 | Paper |
| Maximum face-constrained coloring of plane graphs | 2004-01-26 | Paper |
| Isometric cycles, cutsets, and crowning of bridged graphs | 2003-07-31 | Paper |
| Ramsey theory and bandwidth of graphs | 2003-05-11 | Paper |
| On the existence of Hamiltonian paths in the cover graph of \(M\)(\(n\)) | 2003-04-28 | Paper |
| On restricted edge-colorings of bicliques | 2002-12-02 | Paper |
| The chromatic spectrum of mixed hypergraphs | 2002-07-29 | Paper |
| On the number of vertices with specified eccentricity | 2002-07-22 | Paper |
| Trifold arrangements and cevian dissections | 2002-06-26 | Paper |
| A Fibonacci tiling of the plane | 2002-05-28 | Paper |
| A proof of the two-path conjecture | 2002-04-25 | Paper |
| Realizing degree imbalances in directed graphs | 2002-03-29 | Paper |
| Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741343 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518334 | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949848 | 2001-02-20 | Paper |
| Multiple vertex coverings by specified induced subgraphs | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390656 | 2000-11-26 | Paper |
| Line digraphs and coreflexive vertex sets | 2000-11-02 | Paper |
| Bandwidth and density for block graphs | 2000-11-02 | Paper |
| Connected Domination and Spanning Trees with Many Leaves | 2000-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489219 | 2000-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4719325 | 2000-07-05 | Paper |
| Perfection thickness of graphs | 2000-05-07 | Paper |
| Edge-Bandwidth of Graphs | 2000-04-10 | Paper |
| A short proof that `proper = unit' | 2000-03-21 | Paper |
| A note on generalized chromatic number and generalized girth | 2000-03-21 | Paper |
| Intersection representation of digraphs in trees with few leaves | 2000-02-15 | Paper |
| Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242965 | 1999-10-11 | Paper |
| The Bricklayer Problem and the Strong Cycle Lemma | 1999-09-09 | Paper |
| The leafage of a chordal graph | 1999-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390687 | 1998-08-10 | Paper |
| The number of dependent arcs in an acyclic orientation | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838186 | 1998-08-09 | Paper |
| Short proofs for interval digraphs | 1998-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4337507 | 1997-10-26 | Paper |
| Large \(2P_ 3\)-free graphs with bounded degree | 1996-11-21 | Paper |
| The superregular graphs | 1996-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871039 | 1996-08-13 | Paper |
| The Total Interval Number of a Graph II: Trees and Complexity | 1996-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871087 | 1996-05-21 | Paper |
| Representing digraphs using intervals or circular arcs | 1996-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4869540 | 1996-03-11 | Paper |
| Gray code enumeration of families of integer partitions | 1995-11-09 | Paper |
| Interval number of special posets and random posets | 1995-09-17 | Paper |
| The 2‐intersection number of paths and bounded‐degree trees | 1995-08-16 | Paper |
| Maximum Bandwidth Under Edge Addition | 1995-08-13 | Paper |
| Size, chromatic number, and connectivity | 1995-08-06 | Paper |
| A Graph-Theoretic Game and Its Application to the k-Server Problem | 1995-07-03 | Paper |
| Acyclic orientations of complete bipartite graphs | 1995-04-17 | Paper |
| The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique | 1995-02-01 | Paper |
| Covering a poset by interval orders | 1994-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304403 | 1994-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138293 | 1994-06-22 | Paper |
| Generating linear extensions by adjacent transpositions | 1994-05-24 | Paper |
| Relaxed chromatic numbers of graphs | 1994-05-10 | Paper |
| Large P4‐free graphs with bounded degree | 1994-03-13 | Paper |
| Subtree and substar intersection numbers | 1994-02-24 | Paper |
| The total interval number of a graph. I: Fundamental classes | 1993-10-17 | Paper |
| Clique coverings of the edges of a random graph | 1993-08-16 | Paper |
| Large regular graphs with no induced \(2K_ 2\) | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010305 | 1992-09-27 | Paper |
| The maximum number of winning 2-sets | 1992-06-28 | Paper |
| Adding up to Powers | 1992-06-26 | Paper |
| The interval inclusion number of a partially ordered set | 1992-06-25 | Paper |
| Spanning Trees with Many Leaves | 1991-01-01 | Paper |
| Wide posets with fixed height and cutset number | 1990-01-01 | Paper |
| Tetrahedrizing point sets in three dimensions | 1990-01-01 | Paper |
| A short proof of the degree bound for interval number | 1989-01-01 | Paper |
| A length-width inequality for partially ordered sets with two-element cutsets | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204503 | 1989-01-01 | Paper |
| The addition game: An abstraction of a communication problem | 1988-01-01 | Paper |
| Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs | 1988-01-01 | Paper |
| Pagenumber of complete bipartite graphs | 1988-01-01 | Paper |
| Two easy duality theorems for product partial orders | 1987-01-01 | Paper |
| Unichain coverings in partial orders with the nested saturation property | 1987-01-01 | Paper |
| Regressions and monotone chains. II: the poset of integer intervals | 1987-01-01 | Paper |
| Sorting by insertion of leading elements | 1987-01-01 | Paper |
| Poset boxicity of graphs | 1987-01-01 | Paper |
| An improved edge bound on the interval number of a graph | 1987-01-01 | Paper |
| The Borsuk-Ulam Theorem and Bisection of Necklaces | 1986-01-01 | Paper |
| ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible | 1986-01-01 | Paper |
| Networks and chain coverings in partial orders and their products | 1985-01-01 | Paper |
| A note on the interval number of a graph | 1985-01-01 | Paper |
| Decomposition of product graphs into complete bipartite subgraphs | 1985-01-01 | Paper |
| Bisection of Circle Colorings | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3684157 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691774 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773921 | 1985-01-01 | Paper |
| Recognizing graphs with fixed interval number is NP-complete | 1984-01-01 | Paper |
| The interval number of a complete multipartite graph | 1984-01-01 | Paper |
| Regressions and monotone chains: A Ramsey-type extremal problem for partial orders | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714105 | 1984-01-01 | Paper |
| The interval number of a planar graph: Three intervals suffice | 1983-01-01 | Paper |
| Some remarks on normalized matching | 1983-01-01 | Paper |
| A class of solutions to the gossip problem. III | 1982-01-01 | Paper |
| A class of solutions to the gossip problem. I | 1982-01-01 | Paper |
| A class of solutions to the gossip problem. II | 1982-01-01 | Paper |
| Gossiping without Duplicate Transmissions | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3964569 | 1982-01-01 | Paper |
| Semiantichains and Unichain Coverings in Direct Products of Partial Orders | 1981-01-01 | Paper |
| A symmetric chain decomposition of L(4,n) | 1980-01-01 | Paper |
| Extremal Values of the Interval Number of a Graph | 1980-01-01 | Paper |
| The number of meets between two subsets of a lattice | 1979-01-01 | Paper |
| Skew chain orders and sets of rectangles | 1979-01-01 | Paper |
| Pairs of Adjacent Hamiltonian Circuits with Small Intersection | 1978-01-01 | Paper |
