The following pages link to Gábor Bacsó (Q442388):
Displaying 40 items.
- Distance domination versus iterated domination (Q442389) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- Optimal guard sets and the Helly property (Q607361) (← links)
- (Q686436) (redirect page) (← links)
- Domination properties and induced subgraphs (Q686437) (← links)
- Characterization of graphs dominated by induced paths (Q868348) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← links)
- Dominating cliques in \(P_ 5\)-free graphs (Q1176051) (← links)
- On a conjecture about uniquely colorable perfect graphs (Q1377674) (← links)
- (Q1612754) (redirect page) (← links)
- Elementary bipartite graphs and unique colourability (Q1612755) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Independence, irredundance, degrees and chromatic number in graphs (Q1861218) (← links)
- Disjoint paired-dominating sets in cubic graphs (Q2334075) (← links)
- Coloring the cliques of line graphs (Q2401798) (← links)
- (Q3012388) (← links)
- A characterization of graphs without long induced paths (Q3204490) (← links)
- Upper chromatic number of finite projective planes (Q3503598) (← links)
- (Q3575455) (← links)
- Perfectly orderable graphs and unique colorability (Q3649399) (← links)
- New near-factorizations of finite groups (Q3653750) (← links)
- (Q4227911) (← links)
- (Q4242951) (← links)
- (Q4405635) (← links)
- (Q4634386) (← links)
- Coloring the Maximal Cliques of Graphs (Q4652597) (← links)
- Graphs without induced P<sub>5</sub>and C<sub>5</sub> (Q4668435) (← links)
- The equal–sum–free subset problem (Q4969019) (← links)
- Integral-root polynomials and chromatic uniqueness of graphs (Q5034991) (← links)
- Chromatic uniqueness of zero-divisor graphs (Q5058160) (← links)
- Dominating Bipartite Subgraphs in Graphs (Q5316262) (← links)
- Graph Domination in Distance Two (Q5316266) (← links)
- The 2‐Blocking Number and the Upper Chromatic Number of <i>PG</i>(2,<i>q</i>) (Q5411948) (← links)
- The cost chromatic number and hypergraph parameters (Q5437220) (← links)
- (Q5461526) (← links)
- An enumeration approach to network evolution (Q6064719) (← links)
- Connected domination in random graphs (Q6107484) (← links)
- Graphs with equal Grundy domination and independence number (Q6108929) (← links)
- The robust chromatic number of graphs (Q6598012) (← links)
