Table of simple cubic graphs

The connected 3-regular (cubic) simple graphs are listed for small vertex numbers.
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2017
0119992017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A graph is called equimatchable if all of its maximal matchings have the same size. Kawarabayashi, Plummer, and Saito showed that… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2017
2017
Let c : E(G) → [k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let c̄(v) = (a1, . . . , ak… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half… (More)
Is this relevant?
Review
2008
Review
2008
A vertex k-coloring of a graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map… (More)
Is this relevant?
1999
1999
We present a collection of results whose central theme is that the phenomenon of the first eigenvalue of the Laplacian being… (More)
  • figure 1
Is this relevant?