Circuit decompositions of Eulerian graphs
type: Item
instance of: scholarly article
title: Circuit decompositions of Eulerian graphs
zbMATH Open document ID: 1028.05092
author: Cun-Quan Zhang
author: Genghua Fan
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-06-25T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1464300
zbMATH Keywords: conjecture of Sabidussi
zbMATH Keywords: minor
MaRDI profile type: Publication
OpenAlex ID: W2024226814
cites work: Cycle covers of cubic multigraphs
cites work: Graphs with the Circuit Cover Property
cites work: Q3852212
cites work: Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
cites work: Q3672016
cites work: On circuit decomposition of planar Eulerian graphs
cites work: Q3734435
cites work: Q3916595
cites work: Even circuits in planar graphs
cites work: On even circuit decompositions of eulerian graphs
cites work: On embeddings of graphs containing noK5-minor
DOI: 10.1006/JCTB.1999.1923
Recommended article: On circuit decomposition of planar Eulerian graphs
Recommended article: On even circuit decompositions of eulerian graphs
Recommended article: Q4013126
Recommended article: Q4457555
Recommended article: Q3831051
Recommended article: A cycle decomposition conjecture for Eulerian graphs
Recommended article: Q3142415
Recommended article: Decompositions of complete graphs into circulants
Recommended article: Q3819088
Recommended article: Circuit decompositions of join-covered graphs
description: scientific article; zbMATH DE number 1464300