The spanning subgraphs of eulerian graphs
From MaRDI portal
Publication:4137209
DOI10.1002/jgt.3190010115zbMath0363.05042OpenAlexW2060069351MaRDI QIDQ4137209
F. T. Boesch, Ralph Tindell, Charles L. Suffel
Publication date: 1977
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190010115
Related Items (58)
Even factors with a bounded number of components in iterated line graphs ⋮ Packing spanning trees in highly essentially connected graphs ⋮ Ore-type degree condition of supereulerian digraphs ⋮ Spanning trails with variations of Chvátal-Erdős conditions ⋮ Constructing featured supereulerian graph ⋮ Editing to a Planar Graph of Given Degrees ⋮ Strengthened Ore conditions for \((s, t)\)-supereulerian graphs ⋮ Plane augmentation of plane graphs to meet parity constraints ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ Deviation estimates for Eulerian edit numbers of random graphs ⋮ Supereulerian width of dense graphs ⋮ Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs ⋮ Graphs without spanning closed trails ⋮ On extremal \(k\)-supereulerian graphs ⋮ A new view on rural postman based on Eulerian extension and matching ⋮ Asymptotically sharpening the $s$-Hamiltonian index bound ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Supereulerian regular matroids without small cocircuits ⋮ Editing to Eulerian graphs ⋮ Subeulerian oriented graphs ⋮ New bounds on Zagreb indices ⋮ Supereulerian graphs in the graph family \(C_{2}(6,k)\) ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs ⋮ Locally dense supereulerian digraphs ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Degree sum and Hamiltonian-connected line graphs ⋮ Spanning cycles in regular matroids without small cocircuits ⋮ Unnamed Item ⋮ Supereulerian graphs and matchings ⋮ On \(( s , t )\)-supereulerian graphs with linear degree bounds ⋮ On 3-edge-connected supereulerian graphs ⋮ Polynomially determine if a graph is \((s,3)\)-supereulerian ⋮ Matching and spanning trails in digraphs ⋮ Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors ⋮ Symmetric core and spanning trails in directed networks ⋮ Collapsible subgraphs of a 4-edge-connected graph ⋮ Graph editing to a given degree sequence ⋮ Sufficient Ore type condition for a digraph to be supereulerian ⋮ On (s,t)-supereulerian graphs in locally highly connected graphs ⋮ Graph Editing to a Given Degree Sequence ⋮ Lai's conditions for spanning and dominating closed trails ⋮ On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\) ⋮ Supereulerian digraphs ⋮ Collapsible biclaw-free graphs ⋮ Efficient Algorithms for Eulerian Extension ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ Editing to a planar graph of given degrees ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ Supereulerian digraphs with given local structures ⋮ Supereulerian graphs and the Petersen graph ⋮ Domino sequencing: scheduling with state-based sequence-dependent setup times ⋮ Spanning trails in essentially 4-edge-connected graphs ⋮ Degree condition for a digraph to be supereulerian ⋮ Supereulerian digraphs with given diameter ⋮ The neighborhood inclusion structure of a graph ⋮ Spectral and extremal conditions for supereulerian graphs
This page was built for publication: The spanning subgraphs of eulerian graphs
