Irreducible \((v_{3})\) configurations and graphs

DOI10.1016/j.disc.2006.07.015zbMath1111.05072OpenAlexW1990726126MaRDI QIDQ864118

Marko Boben

Publication date: 13 February 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.015

zbMATH Keywords

cubic graphincidence structure

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

On constructions and parameters of symmetric configurations \(v_k\) ⋮ Locally arc-transitive graphs of valence \(\{3,4\}\) with trivial edge kernel ⋮ Variations on Ramsey numbers and minimum numbers of monochromatic triangles in line $2$-colorings of configurations ⋮ Irreducible pseudo 2-factor isomorphic cubic bipartite graphs ⋮ Colouring problems for symmetric configurations with block size 3 ⋮ On the upper embedding of symmetric configurations with block size 3

Cites Work

• Configurations and graphs
• Computational synthetic geometry
• Inductive classes of bipartite cubic graphs
• Cyclic Haar graphs
• Configurations and graphs. II
• Configurations and their realization
• Polycyclic configurations
• Counting symmetric configurations \(v_3\)
• Reduction of symmetric configurations \(n_3\)
• Are These Figures Oxymora?
• Self-dual configurations and regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Irreducible \((v_{3})\) configurations and graphs