Hajo Broersma

From MaRDI portal
(Redirected from Person:339483)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Growth rates of the bipartite Erdős-Gyárfás function
Journal of Graph Theory
2024-11-24Paper
Turán numbers of general star forests in hypergraphs
Discrete Mathematics
2024-11-09Paper
Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number
Discrete Applied Mathematics
2024-09-26Paper
The complexity of spanning tree problems involving graphical indices
Discrete Applied Mathematics
2024-02-27Paper
The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number
Linear Algebra and its Applications
2024-02-05Paper
The skew spectral radius and skew Randić spectral radius of general random oriented graphs
Linear Algebra and its Applications
2024-02-05Paper
Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
Journal of Graph Theory
2024-01-04Paper
Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number
Discrete Mathematics
2023-10-30Paper
The Erdős–Gyárfás function with respect to Gallai‐colorings
Journal of Graph Theory
2023-10-05Paper
Edge‐colored complete graphs without properly colored even cycles: A full characterization
Journal of Graph Theory
2023-10-04Paper
Tur\'{a}n numbers of general hypergraph star forests2023-06-13Paper
Spectral radius conditions for the existence of all subtrees of diameter at most four
Linear Algebra and its Applications
2023-02-21Paper
Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
Discrete Applied Mathematics
2023-01-11Paper
The effect of graph operations on the degree-based entropy
Applied Mathematics and Computation
2022-11-16Paper
The spectra of random mixed graphs
Linear Algebra and its Applications
2022-09-28Paper
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees
Discrete Mathematics
2022-09-26Paper
Integer colorings with no rainbow 3-term arithmetic progression
The Electronic Journal of Combinatorics
2022-05-12Paper
The Hamiltonian properties in \(K_{1,r}\)-free split graphs
Discrete Mathematics
2022-04-11Paper
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs
Journal of Graph Theory
2022-03-31Paper
On hamiltonicity of 1-tough triangle-free graphs
Electronic Journal of Graph Theory and Applications
2022-03-14Paper
Toughness, forbidden subgraphs, and Hamilton-connected graphs
Discussiones Mathematicae Graph Theory
2022-01-03Paper
Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
Graphs and Combinatorics
2021-11-30Paper
Sharp upper bounds for augmented Zagreb index of graphs with fixed parameters2021-11-15Paper
Growth rates of the bipartite Erd\H{o}s-Gy\'{a}rf\'{a}s function2021-11-01Paper
Spectral radius conditions for the existence of all subtrees of diameter at most four
(available as arXiv preprint)
2021-09-23Paper
Extremal problems and results related to Gallai-colorings
Discrete Mathematics
2021-09-06Paper
On a directed tree problem motivated by a newly introduced graph product
Electronic Journal of Graph Theory and Applications
2021-08-16Paper
Toughness, forbidden subgraphs and pancyclicity
Graphs and Combinatorics
2021-08-12Paper
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Journal of Combinatorial Optimization
2021-05-10Paper
On sufficient spectral radius conditions for Hamiltonicity
Discrete Applied Mathematics
2021-04-20Paper
Extremality of VDB topological indices over f-benzenoids with given order
Applied Mathematics and Computation
2021-04-14Paper
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph
Discussiones Mathematicae Graph Theory
2021-02-10Paper
On the spectra of general random mixed graphs
The Electronic Journal of Combinatorics
2021-01-29Paper
Almost Eulerian compatible spanning circuits in edge-colored graphs
Discrete Mathematics
2021-01-21Paper
Spectral properties of inverse sum indeg index of graphs
Journal of Mathematical Chemistry
2020-09-24Paper
On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
Linear Algebra and its Applications
2020-08-28Paper
Philosophy of Computation
Natural Computing Series
2020-07-10Paper
Computability and Complexity of Unconventional Computing Devices
Natural Computing Series
2020-07-10Paper
On sufficient degree conditions for traceability of claw-free graphs
Discrete Mathematics
2020-05-21Paper
Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs
Discrete Mathematics
2019-12-12Paper
scientific article; zbMATH DE number 7075896 (Why is no real title available?)2019-07-03Paper
A polynomial algorithm for weighted scattering number in interval graphs
Discrete Applied Mathematics
2019-06-20Paper
Decompositions of graphs based on a new graph product
Discrete Applied Mathematics
2019-03-28Paper
Properly edge-colored theta graphs in edge-colored complete graphs
Graphs and Combinatorics
2019-03-21Paper
Independent sets in asteroidal triple-free graphs
Automata, Languages and Programming
2018-07-04Paper
Conditions for graphs to be path partition optimal
Discrete Mathematics
2018-04-05Paper
Ramsey numbers of trees versus fans
Discrete Mathematics
2017-09-28Paper
Extremal and degree conditions for path extendability in digraphs
SIAM Journal on Discrete Mathematics
2017-09-18Paper
Cycle extension in edge-colored complete graphs
Discrete Mathematics
2017-08-29Paper
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs
(available as arXiv preprint)
2017-08-29Paper
An exact formula for all star-kipas Ramsey numbers
Graphs and Combinatorics
2017-06-29Paper
Forbidden subgraphs for Hamiltonicity of 1-tough graphs
Discussiones Mathematicae Graph Theory
2016-11-11Paper
Hamiltonian properties of almost locally connected claw-free graphs.
Ars Combinatoria
2016-10-26Paper
On the complexity of edge-colored subgraph partitioning problems in network optimization
Discrete Mathematics and Theoretical Computer Science. DMTCS
2016-08-23Paper
Paths and cycles in colored graphs2016-07-01Paper
On fan-wheel and tree-wheel Ramsey numbers
Discrete Mathematics
2016-06-20Paper
Narrowing down the gap on cycle-star Ramsey numbers
Journal of Combinatorics
2016-05-25Paper
On star-critical and upper size Ramsey numbers
Discrete Applied Mathematics
2016-02-12Paper
Three results on cycle-wheel Ramsey numbers
Graphs and Combinatorics
2015-12-17Paper
Closing the gap on path-kipas Ramsey numbers
The Electronic Journal of Combinatorics
2015-08-27Paper
A NOTE ON RAMSEY NUMBERS FOR FANS
Bulletin of the Australian Mathematical Society
2015-08-14Paper
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory
2015-07-23Paper
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory
2015-07-23Paper
Characterizing heavy subgraph pairs for pancyclicity
Graphs and Combinatorics
2015-05-22Paper
A remark on star-\(C_4\) and wheel-\(C_4\) Ramsey numbers
Electronic Journal of Graph Theory and Applications
2015-03-05Paper
Forbidden subgraph pairs for traceability of block-chains
Electronic Journal of Graph Theory and Applications
2015-03-05Paper
A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs
Theoretical Computer Science
2015-01-30Paper
Best monotone degree conditions for graph properties: a survey
Graphs and Combinatorics
2015-01-20Paper
Removable edges and chords of longest cycles in 3-connected graphs
Graphs and Combinatorics
2014-06-16Paper
On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
Journal of Graph Theory
2014-05-22Paper
Heavy subgraph pairs for traceability of block-chains
Discussiones Mathematicae Graph Theory
2014-05-16Paper
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
Theoretical Computer Science
2014-01-07Paper
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Graph-Theoretic Concepts in Computer Science
2013-12-06Paper
Tank-ring factors in supereulerian claw-free graphs
Graphs and Combinatorics
2013-06-26Paper
Toughness and vertex degrees
Journal of Graph Theory
2013-03-07Paper
Exact algorithms for finding longest cycles in claw-free graphs
Algorithmica
2013-03-05Paper
Three complexity results on coloring \(P_k\)-free graphs
European Journal of Combinatorics
2013-01-24Paper
Fully decomposable split graphs
European Journal of Combinatorics
2013-01-24Paper
Degree sequences and the existence of \(k\)-factors
Graphs and Combinatorics
2012-12-27Paper
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms
2012-09-13Paper
Pairs of forbidden induced subgraphs for homogeneously traceable graphs
Discrete Mathematics
2012-09-12Paper
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
Parameterized and Exact Computation
2012-06-15Paper
More about subcolorings
Computing
2012-06-04Paper
Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time
Theoretical Computer Science
2012-05-14Paper
Updating the complexity status of coloring graphs without a fixed induced linear forest
Theoretical Computer Science
2012-03-13Paper
How many conjectures can you stand? A survey
Graphs and Combinatorics
2012-01-24Paper
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
Journal of Graph Theory
2011-12-20Paper
The complexity status of problems related to sparsest cuts
Lecture Notes in Computer Science
2011-05-19Paper
On coloring graphs without induced forests
Algorithms and Computation
2010-12-09Paper
Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
Graph Theoretic Concepts in Computer Science
2010-11-16Paper
Computing sharp 2-factors in claw-free graphs
Journal of Discrete Algorithms
2010-08-18Paper
Fast exact algorithms for Hamiltonicity in claw-free graphs
Graph-Theoretic Concepts in Computer Science
2010-01-21Paper
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
Graphs and Combinatorics
2010-01-18Paper
Backbone colorings for networks.
Lecture Notes in Computer Science
2010-01-12Paper
\(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
Discrete Mathematics
2009-12-15Paper
Three complexity results on coloring \(P _{k }\)-free graphs
Lecture Notes in Computer Science
2009-12-11Paper
Fully decomposable split graphs
Lecture Notes in Computer Science
2009-12-11Paper
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
Discussiones Mathematicae Graph Theory
2009-08-03Paper
On hamiltonicity of \(P_{3}\)-dominated graphs
Mathematical Methods of Operations Research
2009-04-27Paper
Upper bounds and algorithms for parallel knock-out numbers
Theoretical Computer Science
2009-03-30Paper
A New Algorithm for On-line Coloring Bipartite Graphs
SIAM Journal on Discrete Mathematics
2009-03-16Paper
Complexity of conditional colorability of graphs
Applied Mathematics Letters
2009-03-04Paper
Computing Sharp 2-Factors in Claw-Free Graphs
Lecture Notes in Computer Science
2009-02-03Paper
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
Discrete Mathematics
2009-01-28Paper
Some families of integral graphs
Discrete Mathematics
2009-01-28Paper
The Computational Complexity of the Parallel Knock-Out Problem
LATIN 2006: Theoretical Informatics
2008-09-18Paper
scientific article; zbMATH DE number 5310068 (Why is no real title available?)2008-08-12Paper
On components of 2-factors in claw-free graphs
Electronic Notes in Discrete Mathematics
2008-06-05Paper
Connected even factors in claw-free graphs
Discrete Mathematics
2008-04-28Paper
The computational complexity of the parallel knock-out problem
Theoretical Computer Science
2008-04-15Paper
Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
Lecture Notes in Computer Science
2008-03-07Paper
Upper Bounds and Algorithms for Parallel Knock-Out Numbers
Structural Information and Communication Complexity
2007-11-15Paper
On the complexity of dominating set problems related to the minimum all-ones problem
Theoretical Computer Science
2007-10-18Paper
Path-kipas Ramsey numbers
Discrete Applied Mathematics
2007-09-19Paper
Tutte sets in graphs I: Maximal tutte sets and D-graphs
Journal of Graph Theory
2007-08-09Paper
Integral trees of diameter 6
Discrete Applied Mathematics
2007-06-26Paper
Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
Discrete Applied Mathematics
2007-06-26Paper
Backbone colorings for graphs: Tree and path backbones
Journal of Graph Theory
2007-06-11Paper
The Ramsey Numbers of Paths Versus Kipases
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
Electronic Notes in Discrete Mathematics
2007-05-29Paper
On-Line Coloring of H-Free Bipartite Graphs
Lecture Notes in Computer Science
2007-05-02Paper
On Ramsey numbers for paths versus wheels
Discrete Mathematics
2007-03-02Paper
Toughness and Hamiltonicity in \(k\)-trees
Discrete Mathematics
2007-03-02Paper
Eliminating graphs by means of parallel knock-out schemes
Discrete Applied Mathematics
2007-02-19Paper
A new upper bound on the cyclic chromatic number
Journal of Graph Theory
2007-01-24Paper
Combinatorial Geometry and Graph Theory
Lecture Notes in Computer Science
2006-10-10Paper
Combinatorial Geometry and Graph Theory
Lecture Notes in Computer Science
2006-10-10Paper
Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
Algorithmica
2006-08-16Paper
Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
Combinatorica
2006-06-30Paper
Toughness in graphs -- a survey
Graphs and Combinatorics
2006-06-16Paper
Path-fan Ramsey numbers
Discrete Applied Mathematics
2006-06-09Paper
Subpancyclicity of line graphs and degree sums along paths
Discrete Applied Mathematics
2006-06-09Paper
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science
2005-12-08Paper
scientific article; zbMATH DE number 2230266 (Why is no real title available?)2005-11-18Paper
scientific article; zbMATH DE number 2230255 (Why is no real title available?)2005-11-18Paper
scientific article; zbMATH DE number 2226729 (Why is no real title available?)2005-11-08Paper
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science
2005-08-22Paper
On stability of the hamiltonian index under contractions and closures
Journal of Graph Theory
2005-06-30Paper
scientific article; zbMATH DE number 2154973 (Why is no real title available?)2005-04-11Paper
scientific article; zbMATH DE number 2147947 (Why is no real title available?)2005-03-21Paper
Radio Labeling with Preassigned Frequencies
SIAM Journal on Optimization
2005-02-23Paper
scientific article; zbMATH DE number 2124082 (Why is no real title available?)2005-01-03Paper
scientific article; zbMATH DE number 2114686 (Why is no real title available?)2004-11-11Paper
scientific article; zbMATH DE number 2105044 (Why is no real title available?)2004-10-01Paper
scientific article; zbMATH DE number 2094524 (Why is no real title available?)2004-08-23Paper
The Hamiltonian index of a graph and its branch-bonds
Discrete Mathematics
2004-08-19Paper
scientific article; zbMATH DE number 2089219 (Why is no real title available?)2004-08-12Paper
Isomorphisms and traversability of directed path graphs
Discussiones Mathematicae Graph Theory
2003-11-17Paper
scientific article; zbMATH DE number 1953083 (Why is no real title available?)2003-07-25Paper
scientific article; zbMATH DE number 1947394 (Why is no real title available?)2003-07-08Paper
Heavy cycles in weighted graphs
Discussiones Mathematicae Graph Theory
2003-06-13Paper
scientific article; zbMATH DE number 1882350 (Why is no real title available?)2003-03-16Paper
Some approaches to a conjecture on short cycles in digraphs
Discrete Applied Mathematics
2002-08-29Paper
On some intriguing problems in Hamiltonian graph theory---a survey
Discrete Mathematics
2002-08-29Paper
A note on minimum degree conditions for supereulerian graphs
Discrete Applied Mathematics
2002-08-29Paper
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
Discrete Applied Mathematics
2002-08-29Paper
A σ_3 type condition for heavy cycles in weighted graphs
Discussiones Mathematicae Graph Theory
2002-08-12Paper
Forbidden subgraphs that imply hamiltonian‐connectedness*
Journal of Graph Theory
2002-07-11Paper
Degree sums and subpancyclicity in line graphs
Discrete Mathematics
2002-06-19Paper
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
Algorithmica
2002-05-21Paper
A fan type condition for heavy cycles in weighted graphs
Graphs and Combinatorics
2002-05-14Paper
Strengthening the closure concept in claw-free graphs
Discrete Mathematics
2002-03-06Paper
Another equivalent of the graceful tree conjecture
Ars Combinatoria
2001-12-17Paper
On factors of 4-connected claw-free graphs
Journal of Graph Theory
2001-12-16Paper
The structure of the planar triangulations in terms of bundles and stars
Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1
2001-12-13Paper
Heavy paths and cycles in weighted graphs
Discrete Mathematics
2001-08-27Paper
scientific article; zbMATH DE number 1536521 (Why is no real title available?)2000-11-28Paper
Closure concepts for claw-free graphs
Discrete Mathematics
2000-11-02Paper
Closure concepts: A survey
Graphs and Combinatorics
2000-10-18Paper
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
Discrete Applied Mathematics
2000-07-19Paper
scientific article; zbMATH DE number 1420489 (Why is no real title available?)2000-06-27Paper
Not every 2-tough graph is Hamiltonian
Discrete Applied Mathematics
2000-04-09Paper
Spanning trees with many or few colors in edge-colored graphs
Discussiones Mathematicae Graph Theory
1999-10-28Paper
Various results on the toughness of graphs1999-06-29Paper
Independent Sets in Asteroidal Triple-Free Graphs
SIAM Journal on Discrete Mathematics
1999-06-27Paper
Independence trees and Hamilton cycles1999-05-11Paper
scientific article; zbMATH DE number 1262790 (Why is no real title available?)1999-04-26Paper
scientific article; zbMATH DE number 1222606 (Why is no real title available?)1999-03-02Paper
scientific article; zbMATH DE number 1107726 (Why is no real title available?)1998-06-23Paper
scientific article; zbMATH DE number 1109399 (Why is no real title available?)1998-01-25Paper
Dirac's minimum degree condition restricted to claws
Discrete Mathematics
1998-01-19Paper
A note on the minimum size of a vertex pancyclic graph
Discrete Mathematics
1997-09-24Paper
Cycles through subsets with large degree sums
Discrete Mathematics
1997-08-10Paper
scientific article; zbMATH DE number 908781 (Why is no real title available?)1997-06-09Paper
Toughness and longest cycles in 2-connected planar graphs1996-11-12Paper
Toughness and hamiltonicity in almost claw-free graphs1996-09-29Paper
scientific article; zbMATH DE number 889954 (Why is no real title available?)1996-09-04Paper
On graphs satisfying a local ore-type condition1996-06-18Paper
scientific article; zbMATH DE number 822747 (Why is no real title available?)1995-12-03Paper
Long cycles in graphs with prescribed toughness and minimum degree
Discrete Mathematics
1995-07-24Paper
Subgraphs, closures and hamiltonicity
Discrete Applied Mathematics
1995-05-03Paper
Toughness, minimum degree, and the existence of 2‐factors
Journal of Graph Theory
1994-11-28Paper
Long cycles, degree sums and neighborhood unions
Discrete Mathematics
1994-07-04Paper
A closure concept based on neighborhood unions of independent triples
Discrete Mathematics
1994-06-12Paper
A generalization of Ore's Theorem involving neighborhood unions
Discrete Mathematics
1994-03-10Paper
On ``The matching polynomial of a polygraph
Discrete Applied Mathematics
1994-01-16Paper
A note on \(K_ 4\)-closures in hamiltonian graph theory
Discrete Mathematics
1993-12-20Paper
Decomposition of bipartite graphs under degree constraints
Networks
1993-09-05Paper
Cycles containing all vertices of maximum degree
Journal of Graph Theory
1993-08-24Paper
Long paths and cycles in tough graphs
Graphs and Combinatorics
1993-06-29Paper
The connectivity of the basis graph of a branching greedoid
Journal of Graph Theory
1992-09-27Paper
scientific article; zbMATH DE number 15353 (Why is no real title available?)1992-06-25Paper
Long dominating cycles and paths in graphs with large neighborhood unions
Journal of Graph Theory
1991-01-01Paper
scientific article; zbMATH DE number 4191710 (Why is no real title available?)1990-01-01Paper
scientific article; zbMATH DE number 4177109 (Why is no real title available?)1990-01-01Paper
scientific article; zbMATH DE number 4137803 (Why is no real title available?)1990-01-01Paper
A generalization of a result of Häggkvist and Nicoghossian
Journal of Combinatorial Theory. Series B
1989-01-01Paper
Path graphs
Journal of Graph Theory
1989-01-01Paper
scientific article; zbMATH DE number 4087695 (Why is no real title available?)1989-01-01Paper
Existence of Δλ-cycles and Δλ-paths
Journal of Graph Theory
1988-01-01Paper
scientific article; zbMATH DE number 4055652 (Why is no real title available?)1988-01-01Paper
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
Journal of Graph Theory
1987-01-01Paper
scientific article; zbMATH DE number 4043880 (Why is no real title available?)1987-01-01Paper
A note on generalized crowns in linear r-graphs
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Hajo Broersma