From the 5 of 146 papers with an AI index.
18 citations
- Université Paris-SaclayFR66 papers
- Sapienza University of RomeIT63 papers
- University of GenoaIT63 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di GenovaIT62 papers
- Jagiellonian UniversityPL62 papers
- The Ohio State UniversityUS62 papers
- University of BolognaIT62 papers
- European Organization for Nuclear ResearchCH61 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di Roma IIT61 papers
- University of PisaIT61 papers
- AGH University of KrakowPL60 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di NapoliIT60 papers
4 papers · 1 filter
Basics of DTS quasigroups: algebra, geometry and enumeration
Aleš Drápal, Terry S. Griggs, Andrew R. Kozlik
A directed triple system can be defined as a decomposition of a complete digraph to directed triples . By setting , , and we get…
Universality in minor-closed graph classes
Tony Huynh, Bojan Mohar, Robert Šámal +2
Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). János Pa…
Ordered Yao graphs: maximum degree, edge density, and clique numbers
Péter Ãgoston, Adrian Dumitrescu, Arsenii Sagdeev +2
For a positive integer and an ordered set of points in the plane, define its \textit{k-sector ordered Yao graphs} as follows. Divide the plane around each point into eq…
Bond Polytope under Vertex- and Edge-sums
Petr Kolman, Hans Raj Tiwary
A cut in a graph is called a {\em bond} if both parts of the cut induce connected subgraphs in , and the {\em bond polytope} is the convex hull of all bonds. Computing the m…