output
19932026
Showing 2014 · math.COShow all

6 papers · 2 filters

math.CO2014★ 2 cited

A counterexample to the pseudo 2-factor isomorphic graph conjecture

Jan Goedgebeur

A graph is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of . Abreu et al. conjectured that , the Hea…

math.CO2014★ 8 cited

Better 3-coloring algorithms: excluding a triangle and a seven vertex path

Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur +4

We present an algorithm to color a graph with no triangle and no induced -vertex path (i.e., a -free graph), where every vertex is assigned a list of possible c…

math.CO2014★ 40 cited

A new family of tight sets in

Jan De Beule, Jeroen Demeyer, Klaus Metsch +1

In this paper, we describe a new infinite family of -tight sets in the hyperbolic quadrics , for $q \equiv 5 \mbox{ or } 9 \bmod{12}$. Unde…

math.CO2014

Linear representations of subgeometries

Stefaan De Winter, Sara Rottey, Geertrui Van de Voorde

The linear representation of a point set in a hyperplane of is a point-line geometry embedded in this projective space. In t…

math.CO2014★ 1 cited

The lattice size of a lattice polygon

Wouter Castryck, Filip Cools

We give upper bounds on the minimal degree of a model in and the minimal bidegree of a model in of the curve defined by a given La…

math.CO2014★ 72 cited

Perfect state transfer on distance-regular graphs and association schemes

Gabriel Coutinho, Chris Godsil, Krystal Guo +1

We consider the representation of a continuous-time quantum walk in a graph by the matrix . We provide necessary and sufficient criteria for distance-regular grap…