The following pages link to Supereulerian graphs: A survey (Q4013420):
Displaying 50 items.
- Ore-type degree condition of supereulerian digraphs (Q284720) (← links)
- On extremal \(k\)-supereulerian graphs (Q383349) (← links)
- On the minimal length of the longest trail in a fixed edge-density graph (Q386380) (← links)
- On spanning tree packings of highly edge connected graphs (Q401495) (← links)
- A note on collapsible graphs and super-Eulerian graphs (Q442301) (← links)
- Spanning cycles in regular matroids without small cocircuits (Q449202) (← links)
- On traceable line graphs (Q489359) (← links)
- Snarks, hypohamiltonian graphs and non-supereulerian graphs (Q503617) (← links)
- The spanning connectivity of line graphs (Q548422) (← links)
- Supereulerian graphs in the graph family \(C_{2}(6,k)\) (Q628342) (← links)
- On 3-edge-connected supereulerian graphs (Q659686) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\) (Q708409) (← links)
- Locally finite graphs with ends: A topological approach. II: Applications (Q709326) (← links)
- Spanning subgraph with Eulerian components (Q764890) (← links)
- Supersaturated graphs and hypergraphs (Q787158) (← links)
- Spanning trails containing given edges (Q817757) (← links)
- Graphs with a 3-cycle-2-cover (Q897268) (← links)
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs (Q906435) (← links)
- On (s,t)-supereulerian graphs in locally highly connected graphs (Q965976) (← links)
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds (Q968110) (← links)
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- An \(s\)-Hamiltonian line graph problem (Q995763) (← links)
- Hamiltonian connectedness in 3-connected line graphs (Q1028425) (← links)
- A note on superbrittle graphs (Q1081614) (← links)
- The reduction of graph families closed under contraction (Q1126283) (← links)
- Graphs without spanning closed trails (Q1126285) (← links)
- Superextensions and the depth of median graphs (Q1175949) (← links)
- Supereulerian graphs, independent sets, and degree-sum conditions (Q1377709) (← links)
- Eulerian subgraphs containing given vertices and hamiltonian line graphs (Q1377854) (← links)
- On maximum number of edges in a spanning eulerian subgraph (Q1421530) (← links)
- The connectivity of acyclic orientation graphs (Q1584217) (← links)
- A note on minimum degree conditions for supereulerian graphs (Q1613362) (← links)
- Packing spanning trees in highly essentially connected graphs (Q1618210) (← links)
- Locally dense supereulerian digraphs (Q1701108) (← links)
- Degree sum and Hamiltonian-connected line graphs (Q1709539) (← links)
- Collapsible subgraphs of a 4-edge-connected graph (Q1741521) (← links)
- Supereulerian graphs and excluded induced minors (Q1903724) (← links)
- Symmetric core and spanning trails in directed networks (Q1981711) (← links)
- Supereulerian digraphs (Q2017061) (← links)
- Degree condition for a digraph to be supereulerian (Q2062894) (← links)
- Supereulerian line graphs (Q2065881) (← links)
- Strengthened Ore conditions for \((s, t)\)-supereulerian graphs (Q2166214) (← links)
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
- On \(s\)-Hamiltonicity of net-free line graphs (Q2219965) (← links)
- Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
- On \(( s , t )\)-supereulerian graphs with linear degree bounds (Q2222943) (← links)
- Polynomially determine if a graph is \((s,3)\)-supereulerian (Q2231716) (← links)
- Matching and spanning trails in digraphs (Q2231788) (← links)
- Sufficient Ore type condition for a digraph to be supereulerian (Q2245087) (← links)
