Vertex removable cycles of graphs and digraphs

MaRDI QIDQ3119451zbMATH OpenFDO

Authors Akram B. Attar, Azhar A. Sangoor

Publication date 12 March 2019

Full work available at URL http://cjms.journals.umz.ac.ir/article_486.html

zbMATH Keywords

connected graphEulerian graphregular graphvertex removable cycle

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• On removable cycles in graphs and digraphs
• On removable cycles in connected graphs.
• Reducibility of Eulerian graphs and digraphs
• On removable cycles through every edge
• Removable cycles avoiding two connected subgraphs

Cited in

(4)

• Cycles having the same modularity and removable edges in 2-connected graphs
• Generating sequences of clique-symmetric graphs via Eulerian digraphs
• Reducibility of Eulerian graphs and digraphs
• On removable cycles in graphs and digraphs

This page was built for publication: Vertex removable cycles of graphs and digraphs

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