| Publication | Date of Publication | Type |
|---|
| An approximation algorithm for 3-Colourability | 2024-02-28 | Paper |
| Complete bipartite graphs without small rainbow subgraphs | 2024-02-14 | Paper |
| Compatible spanning circuits and forbidden induced subgraphs | 2024-01-29 | Paper |
| Deciding 3-colourability in less than O(1.415n) steps | 2024-01-05 | Paper |
| Gallai–Ramsey number for K5 ${K}_{5}$ | 2023-10-05 | Paper |
| Loose edge-connection of graphs | 2023-08-03 | Paper |
| Gallai-Ramsey numbers for fans | 2023-03-10 | Paper |
| The conflict-free vertex-connection number and degree conditions of graphs | 2022-09-28 | Paper |
| Gallai-Ramsey number for the union of stars | 2022-09-12 | Paper |
| Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions | 2022-08-24 | Paper |
| The proper 2-connection number and size of graphs | 2022-08-24 | Paper |
| Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 | 2022-04-11 | Paper |
| Ramsey and Gallai-Ramsey number for wheels | 2022-03-15 | Paper |
| From colourful to rainbow paths in graphs: colouring the vertices | 2021-11-25 | Paper |
| Conflict-free connection number and size of graphs | 2021-11-25 | Paper |
| Maximum independent sets near the upper bound | 2021-05-19 | Paper |
| Proper rainbow connection number of graphs | 2021-03-11 | Paper |
| Conflict-free vertex connection number at most 3 and size of graphs | 2021-02-10 | Paper |
| Ramsey and Gallai-Ramsey numbers for stars with extra independent edges | 2020-08-31 | Paper |
| On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs | 2019-06-27 | Paper |
| Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey | 2019-03-21 | Paper |
| Gallai-Ramsey numbers for fans | 2019-02-27 | Paper |
| Graphs with conflict-free connection number two | 2019-01-11 | Paper |
| On the chromatic number of \(2 K_2\)-free graphs | 2018-12-18 | Paper |
| On the chromatic number of (P_{5},windmill)-free graphs | 2018-10-23 | Paper |
| Odd connection and odd vertex-connection of graphs | 2018-10-23 | Paper |
| On upper bounds for the independent transversal domination number | 2018-01-11 | Paper |
| Minimum degree conditions for the proper connection number of graphs | 2017-10-11 | Paper |
| Proper connection and size of graphs | 2017-09-05 | Paper |
| On sequential heuristic methods for the maximum independent set problem | 2017-04-12 | Paper |
| Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach | 2017-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2971248 | 2017-04-04 | Paper |
| Proper connection number 2, connectivity, and forbidden subgraphs | 2017-02-14 | Paper |
| On the minimum degree and the proper connection number of graphs | 2017-02-14 | Paper |
| On the chromatic number of \((P_{5},K_{2,t})\)-free graphs | 2017-02-14 | Paper |
| Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability | 2017-02-06 | Paper |
| 4-colorability of \(P_6\)-free graphs | 2016-10-14 | Paper |
| The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs | 2016-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816040 | 2016-07-01 | Paper |
| A lower bound on the independence number of a graph in terms of degrees and local clique sizes | 2016-06-21 | Paper |
| Sufficient conditions for 2-rainbow connected graphs | 2016-06-21 | Paper |
| On star-wheel Ramsey numbers | 2016-06-13 | Paper |
| On the maximum weight of a sparse connected graph of given order and size | 2016-06-09 | Paper |
| Ralph Faudree (1938--2015) | 2016-04-27 | Paper |
| Kernelization of the 3-path vertex cover problem | 2016-04-27 | Paper |
| Chromatic number of \(P_5\)-free graphs: Reed's conjecture | 2016-04-27 | Paper |
| On the maximum weight of a dense connected graph of given order and size | 2016-04-27 | Paper |
| Dense arbitrarily partitionable graphs | 2016-01-26 | Paper |
| Hypohamiltonian oriented graphs of all possible orders | 2015-12-17 | Paper |
| Rainbow numbers for graphs containing small cycles | 2015-12-17 | Paper |
| Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 | 2015-12-08 | Paper |
| New sufficient conditions for \(\alpha\)-redundant vertices | 2015-06-01 | Paper |
| Rainbow connection and forbidden subgraphs | 2015-06-01 | Paper |
| The maximum independent set problem in subclasses of subcubic graphs | 2015-06-01 | Paper |
| Extending the MAX algorithm for maximum independent set | 2015-05-11 | Paper |
| Graphs with 4-rainbow index 3 and \(n-1\) | 2015-05-11 | Paper |
| Rainbow Numbers for Cycles in Plane Triangulations | 2015-03-24 | Paper |
| Graphs with 3-rainbow index \(n-1\) and \(n-2\) | 2015-03-04 | Paper |
| On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 | 2014-12-19 | Paper |
| Rainbow connection in oriented graphs | 2014-12-03 | Paper |
| On the minimum rainbow subgraph number of a graph | 2014-10-22 | Paper |
| Rainbow numbers for matchings in plane triangulations | 2014-08-08 | Paper |
| Rainbow connection and minimum degree | 2014-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405463 | 2014-04-02 | Paper |
| On maximum weight of a bipartite graph of given order and size | 2013-12-13 | Paper |
| Rainbow connection in sparse graphs | 2013-12-13 | Paper |
| The rainbow connection number of 2-connected graphs | 2013-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857441 | 2013-11-01 | Paper |
| Rainbow connection number of dense graphs | 2013-10-31 | Paper |
| Improved approximation bounds for the minimum rainbow subgraph problem | 2013-04-04 | Paper |
| On minimally rainbow \(k\)-connected graphs | 2013-03-12 | Paper |
| Dense arbitrarily vertex decomposable graphs | 2013-01-03 | Paper |
| Rainbow numbers for graphs with cyclomatic number at most two | 2012-10-25 | Paper |
| Improved degree conditions for Hamiltonian properties | 2012-07-04 | Paper |
| A Dirac theorem for trestles | 2012-06-18 | Paper |
| Closures, cycles, and paths | 2012-06-13 | Paper |
| A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity | 2012-04-26 | Paper |
| On computing the minimum 3-path vertex cover and dissociation number of graphs | 2011-12-07 | Paper |
| Closure for spanning trees and distant area | 2011-10-05 | Paper |
| Graphs with rainbow connection number two | 2011-08-24 | Paper |
| Bounds for the rainbow connection number of graphs | 2011-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3015633 | 2011-07-13 | Paper |
| A new bound on the domination number of graphs with minimum degree two | 2011-02-17 | Paper |
| Cycle length parities and the chromatic number | 2010-11-10 | Paper |
| Approximation algorithms for the minimum rainbow subgraph problem | 2010-10-18 | Paper |
| On maximum independent sets in \(P_{5}\)-free graphs | 2010-10-11 | Paper |
| Structural properties and hamiltonicity of neighborhood graphs | 2010-10-07 | Paper |
| Random procedures for dominating sets in graphs | 2010-08-12 | Paper |
| Packing disjoint cycles over vertex cuts | 2010-05-28 | Paper |
| On F-independence in graphs | 2010-05-14 | Paper |
| Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) | 2010-05-05 | Paper |
| Colourings of graphs with two consecutive odd cycle lengths | 2009-12-15 | Paper |
| On the circumference of a graph and its complement | 2009-12-15 | Paper |
| Rainbow Connection in Graphs with Minimum Degree Three | 2009-12-11 | Paper |
| A rainbow \(k\)-matching in the complete graph with \(r\) colors | 2009-07-08 | Paper |
| Non‐path spectrum sets | 2009-06-04 | Paper |
| Efficiency in exponential time for domination-type problems | 2009-03-04 | Paper |
| The independence number in graphs of maximum degree three | 2009-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3515428 | 2008-07-29 | Paper |
| Chvátal-Erdös condition and pancyclism | 2008-07-01 | Paper |
| Chvátal Erdős condition and 2-factors with a specyfied number of components | 2008-06-18 | Paper |
| Algorithmic bounds for the chromatic number† | 2008-03-10 | Paper |
| New sufficient conditions for hamiltonian and pancyclic graphs | 2008-02-22 | Paper |
| A new upper bound for the chromatic number of a graph | 2008-02-22 | Paper |
| A lower bound on the independence number of a graph in terms of degrees | 2008-01-18 | Paper |
| On the complexity of 4-coloring graphs without long induced paths | 2008-01-07 | Paper |
| Upper bounds for the chromatic number of a graph | 2007-05-29 | Paper |
| Rainbows in the hypercube | 2007-05-10 | Paper |
| Independence number and vertex-disjoint cycles | 2007-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424790 | 2007-03-05 | Paper |
| Degree conditions for Hamiltonicity: counting the number of missing edges | 2007-03-02 | Paper |
| Extremal problems for imbalanced edges | 2006-06-16 | Paper |
| Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs | 2005-11-01 | Paper |
| An asymptotic result for the path partition conjecture | 2005-11-01 | Paper |
| The Cycle-Complete Graph Ramsey Number r(C5, K7) | 2005-09-12 | Paper |
| Vertex colouring and forbidden subgraphs -- a survey | 2004-12-13 | Paper |
| Cycle lengths and chromatic number of graphs | 2004-10-01 | Paper |
| Rainbow numbers for matchings and complete graphs | 2004-10-01 | Paper |
| The Ramsey number r(C7,C7,C7) | 2004-03-25 | Paper |
| 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. | 2004-03-14 | Paper |
| All cycle‐complete graph Ramsey numbers r(Cm, K6) | 2004-02-03 | Paper |
| 0-dual closures for several classes of graphs | 2003-10-16 | Paper |
| Two‐factors each component of which contains a specified vertex | 2003-07-31 | Paper |
| Degree conditions for k‐ordered hamiltonian graphs | 2003-04-03 | Paper |
| Longest paths and longest cycles in graphs with large degree sums | 2003-03-25 | Paper |
| Chromatic number of graphs each path of which is 3-colourable | 2003-03-18 | Paper |
| Colouring Graphs with Prescribed Induced Cycle Lengths | 2003-01-07 | Paper |
| Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780499 | 2002-11-20 | Paper |
| Vertex pancyclic graphs | 2002-08-29 | Paper |
| Three-colourability and forbidden subgraphs. II: Polynomial algorithms | 2002-08-29 | Paper |
| On the stability for pancyclicity | 2002-08-12 | Paper |
| On a max-min problem concerning weights of edges | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741362 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741365 | 2001-09-23 | Paper |
| On the independence number of a graph in terms of order and size | 2001-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712590 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518399 | 2000-11-28 | Paper |
| A planarity criterion for cubic bipartite graphs | 2000-11-02 | Paper |
| 2-factors and Hamiltonicity | 2000-11-02 | Paper |
| Ramsey numbers \(r(K_3, G)\) for \(G\cong K_7-2P_2\) and \(G\cong K_7-3P_2\) | 2000-11-02 | Paper |
| On-line rankings of graphs | 2000-10-23 | Paper |
| Closure concepts: A survey | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940082 | 2000-03-01 | Paper |
| Forbidden subgraphs, stability and hamiltonicity | 2000-01-11 | Paper |
| On quadrilaterals in a graph | 1999-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252433 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838206 | 1999-01-11 | Paper |
| On the computational complexity of (O,P)-partition problems | 1998-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400853 | 1998-10-25 | Paper |
| Small cycles in Hamiltonian graphs | 1998-03-02 | Paper |
| Dirac's minimum degree condition restricted to claws | 1998-01-19 | Paper |
| Ramsey numbers \(r(K_ 3,G)\) for connected graphs \(G\) of order seven | 1997-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882469 | 1997-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4879180 | 1996-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882470 | 1996-09-04 | Paper |
| The flower conjecture in special classes of graphs | 1996-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862340 | 1996-06-18 | Paper |
| Insertible vertices, neighborhood intersections, and hamiltonicity | 1996-03-10 | Paper |
| On the independence number in \(K_{1,r+1}\)-free graphs | 1995-11-26 | Paper |
| Problems remaining NP-complette for sparse or dense graphs | 1995-11-08 | Paper |
| Subgraphs, closures and hamiltonicity | 1995-05-03 | Paper |
| The \(k\)-SATISFIABILITY problem remains NP-complete for dense families | 1995-01-02 | Paper |
| On Path-Tough Graphs | 1994-12-20 | Paper |
| A closure concept based on neighborhood unions of independent triples | 1994-06-12 | Paper |
| Computation of the 0-dual closure for hamiltonian graphs | 1994-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283247 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694753 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995378 | 1992-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976638 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491602 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3807250 | 1988-01-01 | Paper |
