Vector spaces and the Petersen graph
From MaRDI portal
Summary: It is shown that a matching covered graph has an ear decomposition with no more than one double ear if and only if there is no set \(S\) of edges such that \(|S \cap A|\) is even for every alternating circuit \(A\) but \(|S \cap C|\) is odd for some even circuit \(C\). Two proofs are presented. The first uses vector spaces and the second is constructive. Some applications are also given.
Recommendations
- scientific article; zbMATH DE number 6863580
- Vector space semi-Cayley graphs
- The genus of graphs associated with vector spaces
- On the regular graphs of finite dimensional vector spaces
- Well-Covered Vector Spaces of Graphs
- Elementary properties of vector space graphs
- scientific article; zbMATH DE number 851472
- scientific article; zbMATH DE number 3851133
- Graphs associated with vector spaces of even dimension: A link with differential geometry
Cited in
(6)- Optimal ear decompositions of matching covered graphs and bases for the matching lattice
- Covering codes of a graph associated with a finite vector space
- scientific article; zbMATH DE number 6863580 (Why is no real title available?)
- Planar cycle-extendable graphs
- Direct sum graph of the subspaces of a finite-dimensional vector space over finite fields
- Symplectic spaces and ear-decomposition of matroids
This page was built for publication: Vector spaces and the Petersen graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010714)
