Representing graphs in Steiner triple systems

DOI10.1007/S00373-012-1279-3zbMATH Open1298.05232OpenAlexW2147895124MaRDI QIDQ742566

Costas Psomas, Dan S. Archdeacon, Terry S. Griggs

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1279-3

zbMATH Keywords

Steiner triple systemindependent setgraph representation

Mathematics Subject Classification ID

Triple systems (05B07) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• On chromatic number of graphs and set-systems
• Maximal Subsets of a given Set having No Triple in Common with a Steiner Triple System on the set
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (5)

Title not available (Why is that?) ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)

This page was built for publication: Representing graphs in Steiner triple systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742566)