The spanning subgraphs of eulerian graphs

Cited in

(70)

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
Ore-type degree condition of supereulerian digraphs
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
On extremal k-supereulerian graphs
Spanning cycles in regular matroids without small cocircuits
Constructing featured supereulerian graph
Graph editing to a given degree sequence
Graph editing to a given degree sequence
Spectral and extremal conditions for supereulerian graphs
Supereulerian graphs and the Petersen graph
Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
Supereulerian digraphs with given local structures
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
Subeulerian oriented graphs
A survey of parameterized algorithms and the complexity of edge modification
Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs
Balanced subeulerian signed graphs and signed line graphs
Supereulerian graphs in the graph family \(C_{2}(6,k)\)
Supereulerian graphs and matchings
Vertex degree sums for supereulerian bipartite digraphs
On 3-edge-connected supereulerian graphs
Edge constrained Eulerian extensions
Squares of graphs are optimally (s, t)-supereulerian
A new condition on dominated pair degree sum for a digraph to be supereulerian
Graphs with supereulerian width 3 and small diameters
Trail trap: a variant of partizan edge geography
Supereulerian oriented graphs with large arc-strong connectivity
Subprime and superprime graphs
Spanning trails avoiding and containing given edges
Dominated pair degree sum conditions of supereulerian digraphs
On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
Editing to a planar graph of given degrees
Spanning Eulerian subdigraph in line digraphs
Essentially 3-edge-connected reduced graph of diameter three
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

This page was built for publication: The spanning subgraphs of eulerian graphs

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