vix.ing · top · new · best · stats · spec

On Graphs that do not Contain a Thomsen Graph

1966/08/01 by William G. Brown · 12 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Circulant graph #Combinatorics #Discrete mathematics #Graph #Graph power #Limits and Structures in Graph Theory #Line graph #Mathematics #Neighbourhood (mathematics) #Vertex (graph theory) #graph theory and CDMA systems

paper · pdf · doi:10.4153/cmb-1966-036-2

openalex publication_date 1966/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

A Thomsen graph [2, p. 22] consists of six vertices partitioned into two classes of three each, with every vertex in one class connected to every vertex in the other; it is the graph of the “gas, water, and electricity” problem [1, p. 206]. (All graphs considered in this paper will be undirected, having neither loops nor multiple edges.)

Citations

Cited by