Pages that link to "Item:Q1188656"
From MaRDI portal
The following pages link to Eulerian graphs and related topics. Part 1, Volume 1 (Q1188656):
Displayed 43 items.
- A forbidden-minor characterization for the class of regular matroids which yield the cographic es-splitting matroids (Q372799) (← links)
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- On conservative and supermagic graphs (Q409352) (← links)
- Supereulerian graphs in the graph family \(C_{2}(6,k)\) (Q628342) (← links)
- Kotzig frames and circuit double covers (Q658033) (← links)
- Splitting off operation for binary matroids and its applications (Q659753) (← links)
- On the linear algebra of local complementation (Q665929) (← links)
- Forbidden-minors for graphic and cographic es-splitting matroids (Q694324) (← links)
- On the excluded minors for regular matroids which yield cographic splitting matroids (Q694453) (← links)
- Forbidden-minors for es-splitting binary gammoids (Q694474) (← links)
- Spanning trails containing given edges (Q817757) (← links)
- Series parallel extensions of plane graphs to dual-Eulerian graphs (Q864153) (← links)
- On semiextensions and circuit double covers (Q875950) (← links)
- Pairs of trees in tree--tree triangulations (Q878648) (← links)
- Finite automata for testing composition-based reconstructibility of sequences (Q931728) (← links)
- Two-factors in orientated graphs with forbidden transitions (Q998498) (← links)
- A note on semiextensions of stable circuits (Q1044930) (← links)
- Hamiltonicity in vertex envelopes of plane cubic graphs (Q1044951) (← links)
- Circuit double covers in special types of cubic graphs (Q1045063) (← links)
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem (Q1197011) (← links)
- A lower bound for the connectivity of directed Euler tour transformation graphs (Q1356528) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- A numbering of the vertices of special networks (Q1356750) (← links)
- Dominating sets whose closed stars form spanning trees (Q1357724) (← links)
- Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs (Q1392551) (← links)
- Cell rotation graphs of strongly connected orientations of plane graphs with an application (Q1408455) (← links)
- Splitting in a binary matroid (Q1584222) (← links)
- Hamilton cycles in tensor product of graphs (Q1584279) (← links)
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs (Q1584322) (← links)
- Straight-ahead walks in Eulerian graphs (Q1827714) (← links)
- Finding paths in graphs avoiding forbidden transitions (Q1861577) (← links)
- Determination of the bases of a splitting matroid (Q1869029) (← links)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A note on the dual of the splitting matroid (Q1933376) (← links)
- Some results involving the splitting operation on binary matroids (Q1935980) (← links)
- Splitting lemma for 2-connected graphs (Q1935986) (← links)
- The complexity of counting Eulerian tours in 4-regular graphs (Q2429360) (← links)
- Decompositions of infinite graphs. II: Circuit decompositions (Q2485949) (← links)
- Twisted duality for embedded graphs (Q2880690) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- (Q5708525) (← links)
- (Q5708611) (← links)