Eulerian subgraphs containing given edges

DOI10.1016/S0012-365X(00)00070-4MaRDI QIDQ5931410zbMATH OpenOpenAlexWikidataFDO

Authors Hong-Jian Lai

Publication date 24 April 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00070-4

zbMATH Keywords

Eulerian subgraphspanning subgraphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Review text

Suppose \(F(L)\), where \(L\) is a nonnegative integer, is a family of graphs such that \(G\in F(L)\) if and only if for any edge subset \(X\subseteq E(G)\), with \(|X|\leq L\), \(G\) has a spanning Eulerian subgraph \(H\), with \(X\subseteq E(H)\). Let \(f(L)\) be the minimum value of \(k\) such that every \(k\)-edge-connected graph is in \(F(L)\). The author defines \(f(L)\) for all \(L\). Some other problems concerning the existence of Eulerian subgraphs containing specified edges are considered.

Recommendations

• Spanning Eulerian subgraphs of 2-edge-connected graphs
• scientific article; zbMATH DE number 1051272
• A note on the maximum number of edges of a spanning Eulerian subgraph.
• Eulerian subgraphs containing given vertices
• On maximum number of edges in a spanning eulerian subgraph

Cited in

(10)

• Edge-connectivity and edges of even factors of graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• Strengthened Ore conditions for (s, t)-supereulerian graphs
• On \(( s , t )\)-supereulerian graphs with linear degree bounds
• Polynomially determine if a graph is \((s,3)\)-supereulerian
• Eulerian subgraphs containing given vertices
• scientific article; zbMATH DE number 21754 (Why is no real title available?)
• scientific article; zbMATH DE number 2177321 (Why is no real title available?)
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• Spanning trails containing given edges

This page was built for publication: Eulerian subgraphs containing given edges

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