Recommendations
Cites work
- scientific article; zbMATH DE number 4043881 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A Contribution to the Theory of Chromatic Polynomials
- Collapsible graphs and matchings
- Edge disjoint spanning trees in random graphs
- Existence of spanning and dominating trails and circuits
- Extremal Values of the Interval Number of a Graph
- Graph theory with applications
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On Spanning and Dominating Circuits in Graphs
- The reduction of graph families closed under contraction
- The total interval number of a graph. I: Fundamental classes
Cited in
(92)- Spectral and extremal conditions for supereulerian graphs
- Spanning trails with variations of Chvátal-Erdős conditions
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- On (s,t)-supereulerian graphs in locally highly connected graphs
- How many conjectures can you stand? A survey
- On computing the Hamiltonian index of graphs
- Symmetric core and spanning trails in directed networks
- Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
- A note on minimum degree conditions for supereulerian graphs
- Catlin's reduced graphs with small orders
- On spanning tree packings of highly edge connected graphs
- Collapsible subgraphs of a 4-edge-connected graph
- Supereulerian graphs and excluded induced minors
- Vertex degree sums for supereulerian bipartite digraphs
- scientific article; zbMATH DE number 6819543 (Why is no real title available?)
- Spanning trails avoiding and containing given edges
- Dominated pair degree sum conditions of supereulerian digraphs
- Ore-type degree condition of supereulerian digraphs
- Packing spanning trees in highly essentially connected graphs
- On s-Hamiltonicity of net-free line graphs
- Matching and spanning trails in digraphs
- Graphs without spanning closed trails
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
- Connected odd factors of graphs
- A note on collapsible graphs and super-Eulerian graphs
- Supereulerian digraphs with given diameter
- Compatible spanning circuits in edge-colored graphs
- On maximum number of edges in a spanning eulerian subgraph
- 5-Cycle Double Covers, 4-Flows, and Catlin Reduction
- Spanning cycles in regular matroids without small cocircuits
- Supereulerian graphs with constraints on the matching number and minimum degree
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- Hamiltonian connectedness in 3-connected line graphs
- On Computing the Hamiltonian Index of Graphs
- Compatible spanning circuits and forbidden induced subgraphs
- On hamiltonian line graphs of hypergraphs
- Spanning trails containing given edges
- The reduction of graph families closed under contraction
- Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros
- scientific article; zbMATH DE number 1369 (Why is no real title available?)
- scientific article; zbMATH DE number 426325 (Why is no real title available?)
- Degree sum and Hamiltonian-connected line graphs
- Graphs with a 3-cycle-2-cover
- Sufficient conditions for a digraph to be supereulerian
- Supereulerian digraphs
- Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs
- Cycle algebras and polytopes of matroids
- New bounds on Zagreb indices
- Squares of graphs are optimally (s, t)-supereulerian
- Supersaturated graphs and hypergraphs
- Strengthened Ore conditions for (s, t)-supereulerian graphs
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- 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
- Locally finite graphs with ends: A topological approach. II: Applications
- Supereulerian graphs, independent sets, and degree-sum conditions
- Supereulerian 3-path-quasi-transitive digraphs
- Degree condition for a digraph to be supereulerian
- Even factors with a bounded number of components in iterated line graphs
- Supereulerian regular matroids without small cocircuits
- Supereulerian digraphs with given local structures
- On traceable line graphs
- The spanning connectivity of line graphs
- Superextensions and the depth of median graphs
- A note on superbrittle graphs
- Supereulerian line graphs
- A new condition on dominated pair degree sum for a digraph to be supereulerian
- Snarks, hypohamiltonian graphs and non-supereulerian graphs
- Supereulerian testing on semi-Eulerian graphs
- Constructing featured supereulerian graph
- Counting minimal cutsets and \(p_c<1\)
- On 3-edge-connected supereulerian graphs
- Graphs with supereulerian width 3 and small diameters
- Locally dense supereulerian digraphs
- Supergraphs and the cubic Leigh-Strassler model
- On extremal k-supereulerian graphs
- Supereulerian graphs and the Petersen graph
- Supereulerian oriented graphs with large arc-strong connectivity
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- An s-Hamiltonian line graph problem
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- Asymptotically sharpening the s-Hamiltonian index bound
- On the general routing polytope
- On the minimal length of the longest trail in a fixed edge-density graph
- A note on the undirected rural postman problem polytope
- Spanning subgraph with Eulerian components
- The connectivity of acyclic orientation graphs
- Supereulerian digraphs with large arc-strong connectivity
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)
