Spanning trails avoiding and containing given edges

DOI10.7151/DMGT.2505MaRDI QIDQ6985875zbMATH OpenFDO

Authors Lan Lei, Xiao-Min Li, Sulin Song, Yikang Xie, Hong-Jian Lai

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2505

zbMATH Keywords

\((s,t)\)-super-Eulerian\(\alpha\)-permutation graphcollapsible graphedge connectivity

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites work

• A hypercube variant with small diameter
• A note on graphs spanned by Eulerian graphs
• A reduction method to find spanning Eulerian subgraphs
• Collapsible subgraphs of a 4-edge-connected graph
• Connectivity of generalized prisms over G
• Graph theory with applications
• Graphs without spanning closed trails
• Hamilton cycles and closed trails in iterated line graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• scientific article; zbMATH DE number 3318502 (Why is no real title available?)
• Large graphs with given degree and diameter. II
• Large survivable nets and the generalized prisms
• On (s,t)-supereulerian graphs in locally highly connected graphs
• On cycle permutation graphs
• On restricted connectivities of permutation graphs
• Polynomially determine if a graph is \((s,3)\)-supereulerian
• Reliability of interconnection networks modeled by a product of graphs
• Supereulerian graphs: A survey
• The connectivity of generalized graph products
• The spanning subgraphs of eulerian graphs

This page was built for publication: Spanning trails avoiding and containing given edges

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