| Publication | Date of Publication | Type |
|---|
| Growth rates of the bipartite Erdős-Gyárfás function | 2024-11-24 | Paper |
| Turán numbers of general star forests in hypergraphs | 2024-11-09 | Paper |
| Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number | 2024-09-26 | Paper |
| The complexity of spanning tree problems involving graphical indices | 2024-02-27 | Paper |
| The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number | 2024-02-05 | Paper |
| The skew spectral radius and skew Randić spectral radius of general random oriented graphs | 2024-02-05 | Paper |
| Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs | 2024-01-04 | Paper |
| Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number | 2023-10-30 | Paper |
| The Erdős–Gyárfás function with respect to Gallai‐colorings | 2023-10-05 | Paper |
| Edge‐colored complete graphs without properly colored even cycles: A full characterization | 2023-10-04 | Paper |
| Tur\'{a}n numbers of general hypergraph star forests | 2023-06-13 | Paper |
| Spectral radius conditions for the existence of all subtrees of diameter at most four | 2023-02-21 | Paper |
| Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs | 2023-01-11 | Paper |
| The effect of graph operations on the degree-based entropy | 2022-11-16 | Paper |
| The spectra of random mixed graphs | 2022-09-28 | Paper |
| On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees | 2022-09-26 | Paper |
| Integer colorings with no rainbow 3-term arithmetic progression | 2022-05-12 | Paper |
| The Hamiltonian properties in \(K_{1,r}\)-free split graphs | 2022-04-11 | Paper |
| Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs | 2022-03-31 | Paper |
| On hamiltonicity of 1-tough triangle-free graphs | 2022-03-14 | Paper |
| Toughness, forbidden subgraphs, and Hamilton-connected graphs | 2022-01-03 | Paper |
| Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs | 2021-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5165208 | 2021-11-15 | Paper |
| Growth rates of the bipartite Erd\H{o}s-Gy\'{a}rf\'{a}s function | 2021-11-01 | Paper |
| Spectral radius conditions for the existence of all subtrees of diameter at most four | 2021-09-23 | Paper |
| Extremal problems and results related to Gallai-colorings | 2021-09-06 | Paper |
| On A Directed Tree Problem Motivated by A Newly Introduced Graph Product | 2021-08-16 | Paper |
| Toughness, forbidden subgraphs and pancyclicity | 2021-08-12 | Paper |
| Some algorithmic results for finding compatible spanning circuits in edge-colored graphs | 2021-05-10 | Paper |
| On sufficient spectral radius conditions for Hamiltonicity | 2021-04-20 | Paper |
| Extremality of VDB topological indices over f-benzenoids with given order | 2021-04-14 | Paper |
| Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph | 2021-02-10 | Paper |
| On the spectra of general random mixed graphs | 2021-01-29 | Paper |
| Almost Eulerian compatible spanning circuits in edge-colored graphs | 2021-01-21 | Paper |
| Spectral properties of inverse sum indeg index of graphs | 2020-09-24 | Paper |
| On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs | 2020-08-28 | Paper |
| Philosophy of Computation | 2020-07-10 | Paper |
| Computability and Complexity of Unconventional Computing Devices | 2020-07-10 | Paper |
| On sufficient degree conditions for traceability of claw-free graphs | 2020-05-21 | Paper |
| Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs | 2019-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967194 | 2019-07-03 | Paper |
| A polynomial algorithm for weighted scattering number in interval graphs | 2019-06-20 | Paper |
| Decompositions of graphs based on a new graph product | 2019-03-28 | Paper |
| Properly edge-colored theta graphs in edge-colored complete graphs | 2019-03-21 | Paper |
| Independent sets in asteroidal triple-free graphs | 2018-07-04 | Paper |
| Conditions for graphs to be path partition optimal | 2018-04-05 | Paper |
| Ramsey numbers of trees versus fans | 2017-09-28 | Paper |
| Extremal and Degree Conditions for Path Extendability in Digraphs | 2017-09-18 | Paper |
| Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs | 2017-08-29 | Paper |
| Cycle extension in edge-colored complete graphs | 2017-08-29 | Paper |
| An exact formula for all star-kipas Ramsey numbers | 2017-06-29 | Paper |
| Forbidden subgraphs for Hamiltonicity of 1-tough graphs | 2016-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2828895 | 2016-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816508 | 2016-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816051 | 2016-07-01 | Paper |
| On fan-wheel and tree-wheel Ramsey numbers | 2016-06-20 | Paper |
| Narrowing down the gap on cycle-star Ramsey numbers | 2016-05-25 | Paper |
| On star-critical and upper size Ramsey numbers | 2016-02-12 | Paper |
| Three results on cycle-wheel Ramsey numbers | 2015-12-17 | Paper |
| Closing the gap on path-kipas Ramsey numbers | 2015-08-27 | Paper |
| A NOTE ON RAMSEY NUMBERS FOR FANS | 2015-08-14 | Paper |
| Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs | 2015-07-23 | Paper |
| Characterizing heavy subgraph pairs for pancyclicity | 2015-05-22 | Paper |
| Forbidden subgraph pairs for traceability of block-chains | 2015-03-05 | Paper |
| A remark on star-C4 and wheel-C4 Ramsey numbers | 2015-03-05 | Paper |
| A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs | 2015-01-30 | Paper |
| Best monotone degree conditions for graph properties: a survey | 2015-01-20 | Paper |
| Removable edges and chords of longest cycles in 3-connected graphs | 2014-06-16 | Paper |
| On Toughness and Hamiltonicity of 2K2‐Free Graphs | 2014-05-22 | Paper |
| Heavy subgraph pairs for traceability of block-chains | 2014-05-16 | Paper |
| Tight complexity bounds for FPT subgraph problems parameterized by the clique-width | 2014-01-07 | Paper |
| Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs | 2013-12-06 | Paper |
| Tank-ring factors in supereulerian claw-free graphs | 2013-06-26 | Paper |
| Toughness and Vertex Degrees | 2013-03-07 | Paper |
| Exact algorithms for finding longest cycles in claw-free graphs | 2013-03-05 | Paper |
| Fully decomposable split graphs | 2013-01-24 | Paper |
| Three complexity results on coloring \(P_k\)-free graphs | 2013-01-24 | Paper |
| Degree sequences and the existence of \(k\)-factors | 2012-12-27 | Paper |
| The complexity of finding uniform sparsest cuts in various graph classes | 2012-09-13 | Paper |
| Pairs of forbidden induced subgraphs for homogeneously traceable graphs | 2012-09-12 | Paper |
| Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width | 2012-06-15 | Paper |
| More about subcolorings | 2012-06-04 | Paper |
| Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time | 2012-05-14 | Paper |
| Updating the complexity status of coloring graphs without a fixed induced linear forest | 2012-03-13 | Paper |
| How many conjectures can you stand? A survey | 2012-01-24 | Paper |
| Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs | 2011-12-20 | Paper |
| The Complexity Status of Problems Related to Sparsest Cuts | 2011-05-19 | Paper |
| On Coloring Graphs without Induced Forests | 2010-12-09 | Paper |
| Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs | 2010-11-16 | Paper |
| Computing sharp 2-factors in claw-free graphs | 2010-08-18 | Paper |
| Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs | 2010-01-21 | Paper |
| Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs | 2010-01-18 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings | 2009-12-15 | Paper |
| Three Complexity Results on Coloring P k -Free Graphs | 2009-12-11 | Paper |
| Fully Decomposable Split Graphs | 2009-12-11 | Paper |
| Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number | 2009-08-03 | Paper |
| On hamiltonicity of \(P_{3}\)-dominated graphs | 2009-04-27 | Paper |
| Upper bounds and algorithms for parallel knock-out numbers | 2009-03-30 | Paper |
| A New Algorithm for On-line Coloring Bipartite Graphs | 2009-03-16 | Paper |
| Complexity of conditional colorability of graphs | 2009-03-04 | Paper |
| Computing Sharp 2-Factors in Claw-Free Graphs | 2009-02-03 | Paper |
| Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks | 2009-01-28 | Paper |
| Some families of integral graphs | 2009-01-28 | Paper |
| The Computational Complexity of the Parallel Knock-Out Problem | 2008-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517248 | 2008-08-12 | Paper |
| On components of 2-factors in claw-free graphs | 2008-06-05 | Paper |
| Connected even factors in claw-free graphs | 2008-04-28 | Paper |
| The computational complexity of the parallel knock-out problem | 2008-04-15 | Paper |
| Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars | 2008-03-07 | Paper |
| Upper Bounds and Algorithms for Parallel Knock-Out Numbers | 2007-11-15 | Paper |
| On the complexity of dominating set problems related to the minimum all-ones problem | 2007-10-18 | Paper |
| Path-kipas Ramsey numbers | 2007-09-19 | Paper |
| Tutte sets in graphs I: Maximal tutte sets and D-graphs | 2007-08-09 | Paper |
| Integral trees of diameter 6 | 2007-06-26 | Paper |
| Tutte sets in graphs. II: The complexity of finding maximum Tutte sets | 2007-06-26 | Paper |
| Backbone colorings for graphs: Tree and path backbones | 2007-06-11 | Paper |
| The Ramsey Numbers of Paths Versus Kipases | 2007-05-29 | Paper |
| Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks | 2007-05-29 | Paper |
| On-Line Coloring of H-Free Bipartite Graphs | 2007-05-02 | Paper |
| Toughness and Hamiltonicity in \(k\)-trees | 2007-03-02 | Paper |
| On Ramsey numbers for paths versus wheels | 2007-03-02 | Paper |
| Eliminating graphs by means of parallel knock-out schemes | 2007-02-19 | Paper |
| A new upper bound on the cyclic chromatic number | 2007-01-24 | Paper |
| Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
| Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
| Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult | 2006-08-16 | Paper |
| Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs | 2006-06-30 | Paper |
| Toughness in graphs -- a survey | 2006-06-16 | Paper |
| Path-fan Ramsey numbers | 2006-06-09 | Paper |
| Subpancyclicity of line graphs and degree sums along paths | 2006-06-09 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708548 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708558 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5703678 | 2005-11-08 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| On stability of the hamiltonian index under contractions and closures | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665544 | 2005-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4659605 | 2005-03-21 | Paper |
| Radio Labeling with Preassigned Frequencies | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4831480 | 2005-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826281 | 2004-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820877 | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4812916 | 2004-08-23 | Paper |
| The Hamiltonian index of a graph and its branch-bonds | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046488 | 2004-08-12 | Paper |
| Isomorphisms and traversability of directed path graphs | 2003-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414486 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411360 | 2003-07-08 | Paper |
| Heavy cycles in weighted graphs | 2003-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797462 | 2003-03-16 | Paper |
| Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion | 2002-08-29 | Paper |
| A note on minimum degree conditions for supereulerian graphs | 2002-08-29 | Paper |
| Some approaches to a conjecture on short cycles in digraphs | 2002-08-29 | Paper |
| On some intriguing problems in Hamiltonian graph theory---a survey | 2002-08-29 | Paper |
| A σ_3 type condition for heavy cycles in weighted graphs | 2002-08-12 | Paper |
| Forbidden subgraphs that imply hamiltonian‐connectedness* | 2002-07-11 | Paper |
| Degree sums and subpancyclicity in line graphs | 2002-06-19 | Paper |
| A generalization of AT-free graphs and a generic algorithm for solving triangulation problems | 2002-05-21 | Paper |
| A fan type condition for heavy cycles in weighted graphs | 2002-05-14 | Paper |
| Strengthening the closure concept in claw-free graphs | 2002-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2761056 | 2001-12-17 | Paper |
| On factors of 4-connected claw-free graphs | 2001-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760687 | 2001-12-13 | Paper |
| Heavy paths and cycles in weighted graphs | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518395 | 2000-11-28 | Paper |
| Closure concepts for claw-free graphs | 2000-11-02 | Paper |
| Closure concepts: A survey | 2000-10-18 | Paper |
| A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944739 | 2000-06-27 | Paper |
| Not every 2-tough graph is Hamiltonian | 2000-04-09 | Paper |
| Spanning trees with many or few colors in edge-colored graphs | 1999-10-28 | Paper |
| Various results on the toughness of graphs | 1999-06-29 | Paper |
| Independent Sets in Asteroidal Triple-Free Graphs | 1999-06-27 | Paper |
| Independence trees and Hamilton cycles | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232780 | 1999-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218149 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373674 | 1998-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4374709 | 1998-01-25 | Paper |
| Dirac's minimum degree condition restricted to claws | 1998-01-19 | Paper |
| A note on the minimum size of a vertex pancyclic graph | 1997-09-24 | Paper |
| Cycles through subsets with large degree sums | 1997-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888104 | 1997-06-09 | Paper |
| Toughness and longest cycles in 2-connected planar graphs | 1996-11-12 | Paper |
| Toughness and hamiltonicity in almost claw-free graphs | 1996-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882470 | 1996-09-04 | Paper |
| On graphs satisfying a local ore-type condition | 1996-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856626 | 1995-12-03 | Paper |
| Long cycles in graphs with prescribed toughness and minimum degree | 1995-07-24 | Paper |
| Subgraphs, closures and hamiltonicity | 1995-05-03 | Paper |
| Toughness, minimum degree, and the existence of 2‐factors | 1994-11-28 | Paper |
| Long cycles, degree sums and neighborhood unions | 1994-07-04 | Paper |
| A closure concept based on neighborhood unions of independent triples | 1994-06-12 | Paper |
| A generalization of Ore's Theorem involving neighborhood unions | 1994-03-10 | Paper |
| On ``The matching polynomial of a polygraph | 1994-01-16 | Paper |
| A note on \(K_ 4\)-closures in hamiltonian graph theory | 1993-12-20 | Paper |
| Decomposition of bipartite graphs under degree constraints | 1993-09-05 | Paper |
| Cycles containing all vertices of maximum degree | 1993-08-24 | Paper |
| Long paths and cycles in tough graphs | 1993-06-29 | Paper |
| The connectivity of the basis graph of a branching greedoid | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971997 | 1992-06-25 | Paper |
| Long dominating cycles and paths in graphs with large neighborhood unions | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3201099 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3211339 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470493 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3816095 | 1989-01-01 | Paper |
| Path graphs | 1989-01-01 | Paper |
| A generalization of a result of Häggkvist and Nicoghossian | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3791178 | 1988-01-01 | Paper |
| Existence of Δλ-cycles and Δλ-paths | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781785 | 1987-01-01 | Paper |
| 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian | 1987-01-01 | Paper |
| A note on generalized crowns in linear r-graphs | N/A | Paper |
