A Note on Sub-Eulerian Graphs

Cited in

(55)

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

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)