Gábor Bacsó

From MaRDI portal
Person:442388

Available identifiers

zbMath Open bacso.gaborMaRDI QIDQ442388

List of research outcomes





PublicationDate of PublicationType
The robust chromatic number of graphs2024-09-04Paper
An enumeration approach to network evolution2023-12-12Paper
Connected domination in random graphs2023-07-03Paper
Graphs with equal Grundy domination and independence number2023-06-30Paper
The robust chromatic number of graphs2023-05-03Paper
The robust chromatic number of certain graph classes2023-05-03Paper
Chromatic uniqueness of zero-divisor graphs2022-12-19Paper
Integral-root polynomials and chromatic uniqueness of graphs2022-02-21Paper
The equal–sum–free subset problem2020-10-02Paper
Disjoint paired-dominating sets in cubic graphs2019-11-06Paper
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs2019-02-14Paper
https://portal.mardi4nfdi.de/entity/Q46343862018-04-10Paper
Coloring the cliques of line graphs2017-09-05Paper
Minimum order of graphs with given coloring parameters2015-01-23Paper
The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)2014-04-25Paper
Distance domination versus iterated domination2012-08-10Paper
https://portal.mardi4nfdi.de/entity/Q30123882011-07-06Paper
Optimal guard sets and the Helly property2010-11-22Paper
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree2010-07-27Paper
Infinite versus finite graph domination2010-05-05Paper
New near-factorizations of finite groups2009-12-28Paper
Perfectly orderable graphs and unique colorability2009-12-03Paper
Complete description of forbidden subgraphs in the structural domination problem2009-06-19Paper
Upper chromatic number of finite projective planes2008-06-05Paper
The cost chromatic number and hypergraph parameters2008-01-18Paper
Characterization of graphs dominated by induced paths2007-03-02Paper
Graph Domination in Distance Two2005-09-12Paper
Dominating Bipartite Subgraphs in Graphs2005-09-12Paper
https://portal.mardi4nfdi.de/entity/Q54615262005-07-26Paper
Graphs without induced P5and C52005-04-19Paper
Coloring the Maximal Cliques of Graphs2005-02-28Paper
https://portal.mardi4nfdi.de/entity/Q44056352003-09-05Paper
Independence, irredundance, degrees and chromatic number in graphs2003-03-16Paper
Elementary bipartite graphs and unique colourability2002-09-04Paper
https://portal.mardi4nfdi.de/entity/Q42429511999-08-31Paper
https://portal.mardi4nfdi.de/entity/Q42279111999-02-02Paper
On a conjecture about uniquely colorable perfect graphs1998-03-24Paper
Domination properties and induced subgraphs1994-03-17Paper
Dominating cliques in \(P_ 5\)-free graphs1992-06-25Paper
A characterization of graphs without long induced paths1990-01-01Paper

Research outcomes over time

This page was built for person: Gábor Bacsó