A note on graphs spanned by Eulerian graphs
From MaRDI portal
Publication:3048875
DOI10.1002/jgt.3190030316zbMath0414.05040OpenAlexW2011395621MaRDI QIDQ3048875
Publication date: 1979
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190030316
Related Items (49)
Even factors with a bounded number of components in iterated line graphs ⋮ Maximum even factors of graphs ⋮ Ore-type degree condition of supereulerian digraphs ⋮ On Computing the Hamiltonian Index of Graphs ⋮ Spanning trails with variations of Chvátal-Erdős conditions ⋮ Constructing featured supereulerian graph ⋮ Strengthened Ore conditions for \((s, t)\)-supereulerian graphs ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ Supereulerian width of dense graphs ⋮ Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs ⋮ On extremal \(k\)-supereulerian graphs ⋮ Compatible spanning circuits in edge-colored graphs ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ Supereulerian regular matroids without small cocircuits ⋮ Fan-type conditions for spanning Eulerian subgraphs ⋮ Subeulerian oriented graphs ⋮ New bounds on Zagreb indices ⋮ Supereulerian graphs in the graph family \(C_{2}(6,k)\) ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs ⋮ Locally dense supereulerian digraphs ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ (Arc-)disjoint flows in networks ⋮ On computing the Hamiltonian index of graphs ⋮ Spanning cycles in regular matroids without small cocircuits ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ Supereulerian graphs and matchings ⋮ On \(( s , t )\)-supereulerian graphs with linear degree bounds ⋮ On 3-edge-connected supereulerian graphs ⋮ Spanning Eulerian subgraphs of large size ⋮ 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 ⋮ Sufficient Ore type condition for a digraph to be supereulerian ⋮ 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 ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ Supereulerian digraphs with given local structures ⋮ Supereulerian graphs and the Petersen graph ⋮ Spanning trails in essentially 4-edge-connected graphs ⋮ On supereulerian 2-edge-coloured graphs ⋮ Degree condition for a digraph to be supereulerian ⋮ Supereulerian digraphs with given diameter ⋮ Spectral and extremal conditions for supereulerian graphs
This page was built for publication: A note on graphs spanned by Eulerian graphs
