English
Related papers

Related papers: The planar cubic Cayley graphs of connectivity 2

200 papers

A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…

Combinatorics · Mathematics 2017-12-15 Jan Goedgebeur , Addie Neyt , Carol T. Zamfirescu

We give the classification of all possible G-graphs for any small binary dihedral subgroup G in GL(2,C) and use this classification to give the combinatorial description of the special representations of G in terms of its maximal cyclic…

Algebraic Geometry · Mathematics 2012-08-09 Álvaro Nolla de Celis

We give a classification of all possible $2$-adic images of Galois representations associated to elliptic curves over $\mathbb{Q}$. To this end, we compute the 'arithmetically maximal' tower of 2-power level modular curves, develop…

Number Theory · Mathematics 2018-01-22 Jeremy Rouse , David Zureick-Brown

We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.

Combinatorics · Mathematics 2015-08-24 Emily Abernethy Marshall , Liana Yepremyan , Zach Gaslowitz

We obtain new examples and the complete list of the rational cuspidal plane curves $C$ with at least three cusps, one of which has multiplicity ${\rm deg}\,C - 2$. It occurs that these curves are projectively rigid. We also discuss the…

alg-geom · Mathematics 2008-02-03 H. Flenner , M. Zaidenberg

A vertex triple $(u,v,w)$ of a graph is called a $2$-geodesic if $v$ is adjacent to both $u$ and $w$ and $u$ is not adjacent to $w$. A graph is said to be $2$-geodesic transitive if its automorphism group is transitive on the set of…

Combinatorics · Mathematics 2022-07-28 Jun-Jie Huang , Yan-Quan Feng , Jin-Xin Zhou , Fu-Gang Yin

To classify complex rational cuspidal curves $E\subseteq \mathbb{P}^2$ it remains to classify the ones with complement of log general type, i.e. the ones for which $\kappa(K_X+D)=2$, where $(X,D)$ is a log resolution of $(\mathbb{P}^2,E)$.…

Algebraic Geometry · Mathematics 2019-04-30 Karol Palka , Tomasz Pełka

A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs,…

Discrete Mathematics · Computer Science 2017-02-07 Pascal Ochem

We give a complete classification of the Kronecker (i.e. direct) product graphs that are planar and $3$-connected (i.e. $3$-polytopal). They are all of the form \[H\wedge K_2,\] where $H$ is a $2$-connected graph, possibly non-planar, and…

Combinatorics · Mathematics 2024-02-05 Riccardo W. Maffucci

Two edge colorings of a graph are {\em edge-Kempe equivalent} if one can be obtained from the other by a series of edge-Kempe switches. This work gives some results for the number of edge-Kempe equivalence classes for cubic graphs. In…

Combinatorics · Mathematics 2012-09-11 sarah-marie belcastro , Ruth Haas

All deformations of two dimensional centrally extended Galilei group are classified. The corresponding quantum Lie algebras are found.

Quantum Algebra · Mathematics 2011-09-22 Anna Opanowicz

Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether…

Data Structures and Algorithms · Computer Science 2011-12-12 Bernhard Haeupler , Krishnam Raju Jampani , Anna Lubiw

The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may…

Quantum Physics · Physics 2011-11-09 Michel R. P. Planat , Metod Saniga

{\em Honeycomb toroidal graphs} are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and…

Combinatorics · Mathematics 2024-12-09 Primoz Sparl

4-critical wheel graphs of higher order are considered concerning their belonging to free-planar or free-Hadwiger classes.

Combinatorics · Mathematics 2011-06-08 Dainis Zeps

We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…

Combinatorics · Mathematics 2013-03-14 Angela Mestre

A connected 3-valent plane graph, whose faces are $q$- or 6-gons only, is called a {\em graph $q_n$}. We classify all graphs $4_n$, which are isometric subgraphs of a $m$-hypercube $H_m$.

Combinatorics · Mathematics 2007-05-23 Michel Deza , Mathieu Dutour-Sikiric , Sergey Shpectorov

This survey purports to be an elementary introduction to compactly presented groups, which are the analogue of finitely presented groups in the broader realm of locally compact groups. In particular, compact presentation is interpreted as a…

Group Theory · Mathematics 2010-03-23 Yves Cornulier

A regular $t$-balanced Cayley map on a group $\Gamma$ is an embedding of a Cayley graph on $\Gamma$ into a surface with certain special symmetric properties. We completely classify regular $t$-balanced Cayley maps for a class of split…

Combinatorics · Mathematics 2024-02-09 Haimiao Chen , Jingrui Zhang

In a planar L-drawing of a directed graph (digraph) each edge e is represented as a polyline composed of a vertical segment starting at the tail of e and a horizontal segment ending at the head of e. Distinct edges may overlap, but not…

Computational Geometry · Computer Science 2020-08-19 Patrizio Angelini , Steven Chaplick , Sabine Cornelsen , Giordano Da Lozzo
‹ Prev 1 8 9 10 Next ›