Exploring equivalent definitions of Eulerian graphs

DOI10.3969/J.ISSN.1000-5641.2018.02.003MaRDI QIDQ4688198zbMATH OpenOpenAlexFDO

Authors Hui Sun, Bing Yao

Publication date 22 October 2018

Full work available at URL http://xblk.ecnu.edu.cn/EN/10.3969/j.issn.1000-5641.2018.02.003

zbMATH Keywords

edge contraction operationEulerian graphnon-adjacent identifying operationvertex subdivision operation

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Probing equivalent definitions of 2-connected graphs
• On equivalent definitions about trees and unicyclic graphs
• On equivalent definitions of trees
• An Eulerian exposition
• Probing equivalent definitions of 2-edge connected graphs

Cited in

(5)

• On equivalent definitions of trees
• Probing equivalent definitions of 2-connected graphs
• On equivalent definitions about trees and unicyclic graphs
• Closed models, strongly connected components and Euler graphs
• Probing equivalent definitions of 2-edge connected graphs

This page was built for publication: Exploring equivalent definitions of Eulerian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4688198)