Even circuits in planar graphs
type: Item
instance of: scholarly article
title: Even circuits in planar graphs
zbMATH Open document ID: 0493.05041
DOI: 10.1016/0095-8956(81)90034-4
author: Paul Seymour
published in: Journal of Combinatorial Theory. Series B
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 3775567
zbMATH Keywords: Euler graph
zbMATH Keywords: edge-disjoint union of circuits
MaRDI profile type: Publication
full work available at URL: 0095-8956(81)90034-4
OpenAlex ID: W1977688378
cites work: Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
cites work: Q5593801
cites work: Q3916595
cites work: Polyhedral decompositions of cubic graphs
description: scientific article; zbMATH DE number 3775567