Supereulerian graphs: A survey
From MaRDI portal
Publication:4013420
DOI10.1002/JGT.3190160209zbMATH Open0771.05059OpenAlexW2022190032MaRDI QIDQ4013420FDOQ4013420
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
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- Title not available (Why is that?)
- On Eulerian and Hamiltonian Graphs and Line Graphs
- The reduction of graph families closed under contraction
- Edge disjoint spanning trees in random graphs
- On Spanning and Dominating Circuits in Graphs
- Title not available (Why is that?)
- Collapsible graphs and matchings
- Extremal Values of the Interval Number of a Graph
- Title not available (Why is that?)
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- The total interval number of a graph. I: Fundamental classes
- Existence of spanning and dominating trails and circuits
Cited In (87)
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- On computing the Hamiltonian index of graphs
- On (s,t)-supereulerian graphs in locally highly connected graphs
- Symmetric core and spanning trails in directed networks
- How many conjectures can you stand? A survey
- A note on minimum degree conditions for supereulerian graphs
- Supereulerian graphs and excluded induced minors
- On spanning tree packings of highly edge connected graphs
- Ore-type degree condition of supereulerian digraphs
- Sufficient Conditions for a Digraph to be Supereulerian
- On \(s\)-Hamiltonicity of net-free line graphs
- Packing spanning trees in highly essentially connected graphs
- Graphs without spanning closed trails
- Parameterized edge Hamiltonicity
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
- Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
- A note on collapsible graphs and super-Eulerian graphs
- Compatible spanning circuits in edge-colored graphs
- On maximum number of edges in a spanning eulerian subgraph
- Supereulerian graphs with constraints on the matching number and minimum degree
- Spanning cycles in regular matroids without small cocircuits
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- On hamiltonian line graphs of hypergraphs
- On Computing the Hamiltonian Index of Graphs
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- Hamiltonian connectedness in 3-connected line graphs
- Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros
- The reduction of graph families closed under contraction
- Spanning trails containing given edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- Degree sum and Hamiltonian-connected line graphs
- Graphs with a 3-cycle-2-cover
- Supereulerian digraphs
- Supersaturated graphs and hypergraphs
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- Locally finite graphs with ends: A topological approach. II: Applications
- Supereulerian graphs, independent sets, and degree-sum conditions
- Even factors with a bounded number of components in iterated line graphs
- On traceable line graphs
- A note on superbrittle graphs
- The spanning connectivity of line graphs
- Superextensions and the depth of median graphs
- Snarks, hypohamiltonian graphs and non-supereulerian graphs
- Supereulerian graphs and the Petersen graph
- On 3-edge-connected supereulerian graphs
- Supergraphs and the cubic Leigh-Strassler model
- On extremal \(k\)-supereulerian graphs
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- An \(s\)-Hamiltonian line graph problem
- On the general routing polytope
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- A note on the undirected rural postman problem polytope
- On the minimal length of the longest trail in a fixed edge-density graph
- Supereulerian digraphs with large arc-strong connectivity
- Spectral and extremal conditions for supereulerian graphs
- The connectivity of acyclic orientation graphs
- Spanning subgraph with Eulerian components
- Spanning trails with variations of Chvátal-Erdős conditions
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- Vertex degree sums for supereulerian bipartite digraphs
- Collapsible subgraphs of a 4-edge-connected graph
- Title not available (Why is that?)
- Matching and spanning trails in digraphs
- 5-Cycle Double Covers, 4-Flows, and Catlin Reduction
- Supereulerian digraphs with given diameter
- Compatible spanning circuits and forbidden induced subgraphs
- Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs
- Cycle algebras and polytopes of matroids
- Squares of graphs are optimally \((s, t)\)-supereulerian
- New bounds on Zagreb indices
- Strengthened Ore conditions for \((s, t)\)-supereulerian graphs
- On \(( s , t )\)-supereulerian graphs with linear degree bounds
- Polynomially determine if a graph is \((s,3)\)-supereulerian
- Sufficient Ore type condition for a digraph to be supereulerian
- Collapsible biclaw-free graphs
- Supereulerian 3-path-quasi-transitive digraphs
- Degree condition for a digraph to be supereulerian
- Supereulerian regular matroids without small cocircuits
- Supereulerian digraphs with given local structures
- Catlin’s reduced graphs with small orders
- A new condition on dominated pair degree sum for a digraph to be supereulerian
- Constructing featured supereulerian graph
- Graphs with supereulerian width 3 and small diameters
- Locally dense supereulerian digraphs
- Title not available (Why is that?)
- Asymptotically sharpening the $s$-Hamiltonian index bound
This page was built for publication: Supereulerian graphs: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013420)
