A Note on Sub-Eulerian Graphs
From MaRDI portal
Publication:4179046
DOI10.1002/jgt.3190030110zbMath0396.05034OpenAlexW2137952152MaRDI QIDQ4179046
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.3190030110
Related Items
A note on minimum degree conditions for supereulerian graphs ⋮ Even factors with a bounded number of components in iterated line graphs ⋮ A note on edge-disjoint Hamilton cycles in line graphs ⋮ Tank-ring factors in supereulerian claw-free graphs ⋮ Contractions of graphs with no spanning Eulerian subgraphs ⋮ Hitting time for \(k\) edge-disjoint spanning trees in a random graph ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ The total interval number of a graph ⋮ Graphs without spanning closed trails ⋮ On extremal \(k\)-supereulerian graphs ⋮ Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ On hamiltonian line graphs of hypergraphs ⋮ Supereulerian regular matroids without small cocircuits ⋮ Subeulerian oriented graphs ⋮ Supereulerian graphs in the graph family \(C_{2}(6,k)\) ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Spanning Eulerian subgraphs of 2-edge-connected graphs ⋮ Spanning cycles in regular matroids without small cocircuits ⋮ Edge-connectivity and edges of even factors of graphs ⋮ Unnamed Item ⋮ Supereulerian graphs and matchings ⋮ On 3-edge-connected supereulerian graphs ⋮ How many conjectures can you stand? A survey ⋮ Bipartite partial duals and circuits in medial graphs ⋮ Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors ⋮ Integer flows and cycle covers ⋮ Hamiltonicity in claw-free graphs ⋮ Collapsible subgraphs of a 4-edge-connected graph ⋮ Snarks, hypohamiltonian graphs and non-supereulerian graphs ⋮ Connected even factors in claw-free graphs ⋮ Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds ⋮ Eulerian subgraphs and Hamilton-connected line graphs ⋮ The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index ⋮ Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ Supereulerian digraphs with given local structures ⋮ Supereulerian graphs and the Petersen graph ⋮ Spanning trails in essentially 4-edge-connected graphs ⋮ Edge disjoint spanning trees in random graphs ⋮ On \(s\)-Hamiltonian line graphs of claw-free graphs ⋮ Spanning trails in a 2-connected graph ⋮ On flows in bidirected graphs ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ Catlin’s reduced graphs with small orders ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees ⋮ Spectral and extremal conditions for supereulerian graphs ⋮ Spanning trails containing given edges
