Vector spaces and the Petersen graph
type: Item
instance of: scholarly article
title: Vector spaces and the Petersen graph
zbMATH Open document ID: 1180.05085
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/117212
full work available at URL: v15i1r9.html
review text: 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.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5540914
zbMATH Keywords: matching covered graph
zbMATH Keywords: ear decomposition
author: Marcelo H. de Carvalho
author: C. H. C. Little
MaRDI profile type: Publication
Recommended article: Q4635961
Recommended article: Q4965339
Recommended article: The genus of graphs associated with vector spaces
Recommended article: Q5099667
Recommended article: Well-Covered Vector Spaces of Graphs
Recommended article: Elementary properties of vector space graphs
Recommended article: Vector-relation configurations and plabic graphs
Recommended article: Q4867943
Recommended article: Q3320416
Recommended article: Graphs associated with vector spaces of even dimension: A link with differential geometry
description: scientific article; zbMATH DE number 5540914