A Note on Sub-Eulerian Graphs

Cited in

(56)

Contractions of graphs with no spanning Eulerian subgraphs
The total interval number of a graph
Graphs without spanning closed trails
Integer flows and cycle covers
Hamiltonicity in claw-free graphs
A note on minimum degree conditions for supereulerian graphs
Edge-connectivity and edges of even factors of graphs
Collapsible subgraphs of a 4-edge-connected graph
Eulerian subgraphs and Hamilton-connected line graphs
Edge disjoint spanning trees in random graphs
Hitting time for \(k\) edge-disjoint spanning trees in a random graph
Spanning Eulerian subgraphs of 2-edge-connected graphs
On \(s\)-Hamiltonian line graphs of claw-free graphs
Spanning trails in a 2-connected graph
Spanning trees and spanning Eulerian subgraphs with small degrees
Even factors with a bounded number of components in iterated line graphs
Tank-ring factors in supereulerian claw-free graphs
Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
Connected even factors in claw-free graphs
On flows in bidirected graphs
Supereulerian graphs with constraints on the matching number and minimum degree
A note on edge-disjoint Hamilton cycles in line graphs
On extremal k-supereulerian graphs
Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
Spanning cycles in regular matroids without small cocircuits
Bipartite partial duals and circuits in medial graphs
Catlin's reduced graphs with small orders
Snarks, hypohamiltonian graphs and non-supereulerian graphs
Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
Sufficient conditions for a digraph to be supereulerian
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
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
Compatible spanning circuits and forbidden induced subgraphs
Balanced subeulerian signed graphs and signed line graphs
Supereulerian graphs in the graph family \(C_{2}(6,k)\)
Supereulerian graphs and matchings
On 3-edge-connected supereulerian graphs
How many conjectures can you stand? A survey
Graphs with supereulerian width 3 and small diameters
The independence number and chromatic number in a reduced graph
Supereulerian of regular matroids with cogirth conditions
Every 3-connected claw-free graph of diameter at most 3 has a 2-factor with at most two components
On \(s\)-Hamiltonian-connected line graphs
The excluded minors for embeddability into a compact surface
Essentially 3-edge-connected reduced graph of diameter three
Spanning trails in essentially 4-edge-connected graphs
Spanning trails containing given edges
Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index

This page was built for publication: A Note on Sub-Eulerian Graphs

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