Pages that link to "Item:Q4137209"
From MaRDI portal
The following pages link to The spanning subgraphs of eulerian graphs (Q4137209):
Displaying 50 items.
- Ore-type degree condition of supereulerian digraphs (Q284720) (← links)
- On extremal \(k\)-supereulerian graphs (Q383349) (← links)
- Spanning cycles in regular matroids without small cocircuits (Q449202) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Supereulerian graphs in the graph family \(C_{2}(6,k)\) (Q628342) (← links)
- Supereulerian graphs and matchings (Q654204) (← links)
- On 3-edge-connected supereulerian graphs (Q659686) (← links)
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\) (Q708409) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Spanning trails in essentially 4-edge-connected graphs (Q741753) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs (Q906435) (← links)
- On (s,t)-supereulerian graphs in locally highly connected graphs (Q965976) (← links)
- Graphs without spanning closed trails (Q1126285) (← links)
- The neighborhood inclusion structure of a graph (Q1310225) (← 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)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← 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)
- Strengthened Ore conditions for \((s, t)\)-supereulerian graphs (Q2166214) (← 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)
- Lai's conditions for spanning and dominating closed trails (Q2260637) (← links)
- Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
- Supereulerian digraphs with given diameter (Q2318192) (← links)
- Even factors with a bounded number of components in iterated line graphs (Q2360854) (← links)
- Spanning trails with variations of Chvátal-Erdős conditions (Q2374180) (← links)
- Supereulerian width of dense graphs (Q2404391) (← links)
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors (Q2462341) (← links)
- Collapsible biclaw-free graphs (Q2501550) (← links)
- Plane augmentation of plane graphs to meet parity constraints (Q2656724) (← links)
- Supereulerian graphs with constraints on the matching number and minimum degree (Q2657064) (← links)
- Deviation estimates for Eulerian edit numbers of random graphs (Q2658005) (← links)
- Supereulerian Digraphs with Large Arc-Strong Connectivity (Q2800596) (← links)
- Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs (Q2935385) (← links)
- New bounds on Zagreb indices (Q2960576) (← links)
- Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- Constructing featured supereulerian graph (Q5059618) (← links)
- Graph Editing to a Given Degree Sequence (Q5740185) (← links)
- Spectral and extremal conditions for supereulerian graphs (Q5870138) (← links)
- Supereulerian graphs and the Petersen graph (Q5920288) (← links)
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs (Q5962521) (← links)
- Supereulerian digraphs with given local structures (Q5964816) (← links)