10.9k citations
- Centre National de la Recherche ScientifiqueFR128 papers
- Université Clermont AuvergneFR88 papers
- Institut PascalFR65 papers
- Aix-Marseille UniversitéFR57 papers
- Czech Technical University in PragueCZ54 papers
- Lyon 1 UniversitéFR54 papers
- University of ManchesterGB54 papers
- Brookhaven National LaboratoryUS53 papers
- Charles UniversityCZ53 papers
- Czech Academy of SciencesCZ53 papers
- Johannes Gutenberg University MainzDE53 papers
- Joint Institute for Nuclear ResearchRU53 papers
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013★ 1 cited
On a class of intersection graphs
Mourad Baïou, Laurent Beaudou, Zhentao Li +1
Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs…
math.CO2013★ 1 cited
Random subgraphs make identification affordable
Florent Foucaud, Guillem Perarnau, Oriol Serra
An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have s…