Supereulerian graphs: A survey

DOI10.1002/jgt.3190160209zbMath0771.05059OpenAlexW2022190032MaRDI QIDQ4013420

Publication date: 27 September 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160209

zbMATH Keywords

supereulerian graphs hamiltonian line graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Eulerian and Hamiltonian graphs (05C45)

Related Items (75)

A note on minimum degree conditions for supereulerian graphs ⋮ Even factors with a bounded number of components in iterated line graphs ⋮ 5-Cycle Double Covers, 4-Flows, and Catlin Reduction ⋮ Packing spanning trees in highly essentially connected 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 ⋮ Supereulerian graphs and excluded induced minors ⋮ Strengthened Ore conditions for $(s, t)$-supereulerian graphs ⋮ Supereulerian graphs with constraints on the matching number and minimum degree ⋮ Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs ⋮ Supereulerian graphs, independent sets, and degree-sum conditions ⋮ Eulerian subgraphs containing given vertices and hamiltonian line graphs ⋮ The reduction of graph families closed under contraction ⋮ Graphs without spanning closed trails ⋮ On extremal $k$-supereulerian graphs ⋮ On the minimal length of the longest trail in a fixed edge-density graph ⋮ Compatible spanning circuits in edge-colored graphs ⋮ Parameterized edge Hamiltonicity ⋮ Asymptotically sharpening the $s$-Hamiltonian index bound ⋮ On spanning tree packings of highly edge connected graphs ⋮ On hamiltonian line graphs of hypergraphs ⋮ Supereulerian regular matroids without small cocircuits ⋮ Graphs with a 3-cycle-2-cover ⋮ 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 ⋮ Cycle algebras and polytopes of matroids ⋮ Locally dense supereulerian digraphs ⋮ Supereulerian graphs with width $s$ and $s$-collapsible graphs ⋮ On computing the Hamiltonian index of graphs ⋮ Degree sum and Hamiltonian-connected line graphs ⋮ Spanning cycles in regular matroids without small cocircuits ⋮ On maximum number of edges in a spanning eulerian subgraph ⋮ On $s$-Hamiltonicity of net-free line graphs ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ On $( s , t )$-supereulerian graphs with linear degree bounds ⋮ On 3-edge-connected supereulerian graphs ⋮ How many conjectures can you stand? A survey ⋮ Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros ⋮ Polynomially determine if a graph is $(s,3)$-supereulerian ⋮ On traceable line graphs ⋮ Matching and spanning trails in digraphs ⋮ Symmetric core and spanning trails in directed networks ⋮ Collapsible subgraphs of a 4-edge-connected graph ⋮ Snarks, hypohamiltonian graphs and non-supereulerian graphs ⋮ Sufficient Ore type condition for a digraph to be supereulerian ⋮ On the general routing polytope ⋮ On (s,t)-supereulerian graphs in locally highly connected graphs ⋮ Supereulerianity of $k$-edge-connected graphs with a restriction on small bonds ⋮ The spanning connectivity of line graphs ⋮ A note on the undirected rural postman problem polytope ⋮ On 3-edge-connected supereulerian graphs in graph family $C(l,k)$ ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Supereulerian digraphs ⋮ Collapsible biclaw-free graphs ⋮ Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs ⋮ An $s$-Hamiltonian line graph problem ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ Supereulerian 3-path-quasi-transitive digraphs ⋮ Supereulerian digraphs with given local structures ⋮ Supereulerian graphs and the Petersen graph ⋮ Unnamed Item ⋮ Degree condition for a digraph to be supereulerian ⋮ Hamiltonian connectedness in 3-connected line graphs ⋮ Spanning subgraph with Eulerian components ⋮ Supereulerian digraphs with given diameter ⋮ The connectivity of acyclic orientation graphs ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ Catlin’s reduced graphs with small orders ⋮ Spectral and extremal conditions for supereulerian graphs ⋮ Spanning trails containing given edges

Cites Work

This page was built for publication: Supereulerian graphs: A survey