C_3

(1, 1, 1)-complete tripartite graph | (1, 2)-fan graph | (1, 3)-Hamming graph | (1, 3)-lattice graph | (1, 3)-queen graph | (1, 3)-rook graph | 1-Hanoi graph | 1-polyiamond 1 | 1-Sierpiński gasket graph | 1-triangular grid graph | ...

vertex count | 3 edge count | 3 connected component count | 1

alternating group | apex | arc-transitive | arrangement | biconnected | braced polygon | bridgeless | cactus | Cayley graphs | chordal | chordless | chromatically unique | circulant | class 2 | claw-free | complete | complete k-partite | complete tripartite | connected | cycle | cyclic | determined by resistance | determined by spectrum | diagonal intersection | distance-regular | distance-transitive | edge-transitive | Eulerian | fan | geodetic | graceful | Hamilton-connected | Hamilton-decomposable | Hamiltonian | Hamming | Hanoi | Harary | H-star connected | integral | Johnson | Kneser | Laman | LCF | line graphs | local | matchstick | nonempty | no perfect matching | odd | Ore | outerplanar | pancyclic | perfect | planar | polyiamond | projective planar | pseudoforest | pseudotree | queen | regular | rook | Sierpiński gasket | simple | split | square-free | stacked prism | strongly perfect | strongly regular | symmetric | traceable | triangular | triangular grid | triangular honeycomb king | triangular honeycomb queen | triangular snake | triangulated | Turán | two-regular | unicyclic | uniquely colorable | uniquely pancyclic | unit-distance | vertex-transitive | weakly perfect | well covered | wreath

3-empty graph

triangle graph

vertex degrees | 2 (3 vertices)

radius | 1 diameter | 1 girth | 3 vertex connectivity | 2 edge connectivity | 2

-((x - 2) (x + 1)^2)

x^2 y + 3 x^2 + 3 x + 1

x^2 + x + y

chromatic number | 3 edge chromatic number | 3