Splittable and unsplittable graphs and configurations

DOI10.26493/1855-3974.1467.04bzbMath1420.51003arXiv1803.06568OpenAlexW2791624594WikidataQ129349085 ScholiaQ129349085MaRDI QIDQ5225018

Branko Grünbaum, Nino Bašić, Jan Grošelj, Tomaž Pisanski

Publication date: 25 July 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.06568

zbMATH Keywords

independent setconfiguration of points and linesGrünbaum graphLevi graphunsplittable configurationunsplittable graphsplitting typecyclic Haar graph

Mathematics Subject Classification ID

Other designs, configurations (05B30) Configuration theorems in linear incidence geometry (51A20)

Related Items (2)

Interview with Tomaž Pisanski ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification of cubic symmetric tricirculants
• On the maximum number of independent elements in configurations of points and lines
• Classification of cubic symmetric tetracirculants and pentacirculants
• A classification of cubic bicirculants
• Cyclic Haar graphs
• Polycyclic configurations
• Cyclic groups are CI-groups for balanced configurations
• Small triangle-free configurations of points and lines
• ALL GENERALIZED PETERSEN GRAPHS ARE UNIT-DISTANCE GRAPHS
• Configurations from a Graphical Viewpoint
• The Number of Cyclic Configurations of Type (v₃) and the Isomorphism Problem
• I-graphs and the corresponding configurations
• Self-dual configurations and regular graphs

This page was built for publication: Splittable and unsplittable graphs and configurations