A characterization of triangular and lattice graphs

DOI10.1007/BF02672912zbMath0913.05082MaRDI QIDQ1288230

Vladislav V. Kabanov

Publication date: 11 May 1999

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

distancediameterregular graphcliqueforbidden subgraph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Claw-free strictly Deza graphs ⋮ Partial geometries, their extensions, and related graphs ⋮ Claw-free graphs with non-clique μ-subgraphs and related geometries

Cites Work

• Unnamed Item
• Extended generalized quadrangles
• Locally cotriangular graphs
• Locally polar spaces and related rank 3 groups
• A characterization of some graphs which do not contain 3-claws
• A characterization of Grassmann and Johnson graphs
• On a characterization of a class of the regular graphs of diameter 2
• Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3

This page was built for publication: A characterization of triangular and lattice graphs