7.9k citations
- University of Illinois Urbana-ChampaignUS495 papers
- Argonne National LaboratoryUS297 papers
- University of MichiganUS290 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT283 papers
- University of GlasgowGB279 papers
- Lawrence Berkeley National LaboratoryUS271 papers
- University of ChicagoUS270 papers
- Michigan State UniversityUS263 papers
- The Ohio State UniversityUS262 papers
- Duke UniversityUS261 papers
- University of LiverpoolGB261 papers
- University of PittsburghUS260 papers
Showing 2010 · math.COShow all
3 papers · 2 filters
math.CO2010
Overlap Number of Graphs
Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier +4
An {\it overlap representation} of a graph assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other…
math.CO2010
Dominating Sets in Triangulations on Surfaces
Hong Liu, Michael J. Pelsmajer
A dominating set D of a graph G is a set such that each vertex v of G is either in the set or adjacent to a vertex in the set. Matheson and Tarjan (1996) proved that any n-vertex p…
math.CO2010
Pancyclic subgraphs of random graphs
Choongbum Lee, Wojciech Samotij
An -vertex graph is called pancyclic if it contains a cycle of length for all . In this paper, we study pancyclicity of random graphs in the context of resi…