A charcterization of 4‐edge‐connected eulerian graphs

DOI10.1002/jgt.3190200111zbMath0832.05071OpenAlexW2072875213MaRDI QIDQ4843510

Peter Weidl

Publication date: 7 January 1996

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200111

zbMATH Keywords

characterizationcycle decompositionspanning treeseulerian graph

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Remarks on virtual bound states for semi—bounded operators

This page was built for publication: A charcterization of 4‐edge‐connected eulerian graphs