Pages that link to "Item:Q3048875"
From MaRDI portal
The following pages link to A note on graphs spanned by Eulerian graphs (Q3048875):
Displayed 49 items.
- Maximum even factors of graphs (Q273183) (← links)
- 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)
- 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)
- Spanning trails in essentially 4-edge-connected graphs (Q741753) (← links)
- Fan-type conditions for spanning Eulerian subgraphs (Q897267) (← links)
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs (Q906435) (← links)
- Locally dense supereulerian digraphs (Q1701108) (← links)
- Spanning Eulerian subgraphs of large size (Q1733865) (← links)
- Collapsible subgraphs of a 4-edge-connected graph (Q1741521) (← links)
- Symmetric core and spanning trails in directed networks (Q1981711) (← links)
- Supereulerian digraphs (Q2017061) (← links)
- On supereulerian 2-edge-coloured graphs (Q2053721) (← links)
- Degree condition for a digraph to be supereulerian (Q2062894) (← links)
- Strengthened Ore conditions for \((s, t)\)-supereulerian graphs (Q2166214) (← links)
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← 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)
- Lai's conditions for spanning and dominating closed trails (Q2260637) (← 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)
- (Arc-)disjoint flows in networks (Q2437760) (← links)
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors (Q2462341) (← links)
- Collapsible biclaw-free graphs (Q2501550) (← links)
- Supereulerian graphs with constraints on the matching number and minimum degree (Q2657064) (← links)
- On computing the Hamiltonian index of graphs (Q2699968) (← 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)
- On Computing the Hamiltonian Index of Graphs (Q5042256) (← links)
- Constructing featured supereulerian graph (Q5059618) (← 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)
- Forbidden pairs of disconnected graphs for supereulerianity of connected graphs (Q6080121) (← links)
- Supereulerian regular matroids without small cocircuits (Q6093141) (← links)
- Subeulerian oriented graphs (Q6137749) (← links)
- Compatible spanning circuits and forbidden induced subgraphs (Q6184989) (← links)
- Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs (Q6197735) (← links)