Connected Vertex Covers in Dense Graphs

2008 ◽  
pp. 35-48 ◽  
Author(s):  
Jean Cardinal ◽  
Eythan Levy
Keyword(s):  
Dense Graphs ◽  
Connected Vertex

scholarly journals Connected vertex covers in dense graphs

2010 ◽  
Vol 411 (26-28) ◽  
pp. 2581-2590 ◽  
Author(s):  
Jean Cardinal ◽  
Eythan Levy
Keyword(s):  
Dense Graphs ◽  
Connected Vertex

Cycle factors in dense graphs

1999 ◽  
Vol 197-198 (1-3) ◽  
pp. 309-323 ◽  
Author(s):  
E Fischer
Keyword(s):  
Dense Graphs

Mixed Ramsey Numbers Revisited

2003 ◽  
Vol 12 (5-6) ◽  
pp. 653-660
Author(s):  
C. C. Rousseau ◽  
S. E. Speed
Keyword(s):  
Asymptotic Behaviour ◽  
Ramsey Number ◽  
Open Problems ◽  
Free Graph ◽  
Ramsey Numbers ◽  
Dense Graphs

Given a graph Hwith no isolates, the (generalized) mixed Ramsey number is the smallest integer r such that every H-free graph of order r contains an m-element irredundant set. We consider some questions concerning the asymptotic behaviour of this number (i) with H fixed and , (ii) with m fixed and a sequence of dense graphs, in particular for the sequence . Open problems are mentioned throughout the paper.

On the Benefits of Adaptivity in Property Testing of Dense Graphs

Algorithmica ◽  
2008 ◽  
Vol 58 (4) ◽  
pp. 811-830 ◽  
Author(s):  
Mira Gonen ◽  
Dana Ron
Keyword(s):  
Property Testing ◽  
Dense Graphs

scholarly journals Colouring and Covering Nowhere Dense Graphs

2016 ◽  
pp. 325-338 ◽  
Author(s):  
Martin Grohe ◽  
Stephan Kreutzer ◽  
Roman Rabinovich ◽  
Sebastian Siebertz ◽  
Konstantinos Stavropoulos
Keyword(s):  
Dense Graphs

scholarly journals A Note on Color-Bias Hamilton Cycles in Dense Graphs

2021 ◽  
Vol 35 (2) ◽  
pp. 970-975
Author(s):  
Andrea Freschi ◽  
Joseph Hyde ◽  
Joanna Lada ◽  
Andrew Treglown
Keyword(s):  
Hamilton Cycles ◽  
Dense Graphs ◽  
Color Bias
Sign in / Sign up

Export Citation Format

Share Document