The spanning subgraphs of eulerian graphs
From MaRDI portal
Publication:4137209
DOI10.1002/jgt.3190010115zbMath0363.05042MaRDI 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
Constructing featured supereulerian graph, Graph Editing to a Given Degree Sequence, Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs, Supereulerian digraphs with given local structures, Supereulerian graphs and the Petersen graph, Spectral and extremal conditions for supereulerian graphs, Asymptotically sharpening the $s$-Hamiltonian index bound, Forbidden pairs of disconnected graphs for supereulerianity of connected graphs, Supereulerian regular matroids without small cocircuits, A survey of parameterized algorithms and the complexity of edge modification, Ore-type degree condition of supereulerian digraphs, On extremal \(k\)-supereulerian graphs, Spanning cycles in regular matroids without small cocircuits, Graph editing to a given degree sequence, Supereulerian graphs in the graph family \(C_{2}(6,k)\), Supereulerian graphs and matchings, On 3-edge-connected supereulerian graphs, On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\), Editing to a planar graph of given degrees, Spanning trails in essentially 4-edge-connected graphs, Editing to Eulerian graphs, Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs, On (s,t)-supereulerian graphs in locally highly connected graphs, Graphs without spanning closed trails, The neighborhood inclusion structure of a graph, Packing spanning trees in highly essentially connected graphs, Locally dense supereulerian digraphs, Degree sum and Hamiltonian-connected line graphs, Collapsible subgraphs of a 4-edge-connected graph, A new view on rural postman based on Eulerian extension and matching, Symmetric core and spanning trails in directed networks, Supereulerian digraphs, Degree condition for a digraph to be supereulerian, 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, Matching and spanning trails in digraphs, Sufficient Ore type condition for a digraph to be supereulerian, Lai's conditions for spanning and dominating closed trails, Domino sequencing: scheduling with state-based sequence-dependent setup times, Supereulerian digraphs with given diameter, Even factors with a bounded number of components in iterated line graphs, Spanning trails with variations of Chvátal-Erdős conditions, Supereulerian width of dense graphs, Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors, Collapsible biclaw-free 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 Digraphs with Large Arc-Strong Connectivity, Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs, New bounds on Zagreb indices, Efficient Algorithms for Eulerian Extension, Editing to a Planar Graph of Given Degrees
