Pages that link to "Item:Q1844855"
From MaRDI portal
The following pages link to Bounds of the number of disjoint spanning trees (Q1844855):
Displaying 50 items.
- A note on edge-disjoint Hamilton cycles in line graphs (Q295256) (← links)
- Edge-disjoint spanning trees and eigenvalues of regular graphs (Q426054) (← links)
- Colouring edges with many colours in cycles (Q462927) (← links)
- Circular flow on signed graphs (Q651035) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation (Q779022) (← links)
- Spanning trails containing given edges (Q817757) (← links)
- On the lower bounds for the maximum genus for simple graphs (Q976145) (← links)
- A sufficient condition on upper embeddability of graphs (Q989758) (← links)
- Up-embeddability via girth and the degree-sum of adjacent vertices (Q1042914) (← links)
- The maximum genus of graph bundles (Q1101120) (← links)
- The total interval number of a graph (Q1119605) (← links)
- Flows and generalized coloring theorems in graphs (Q1133552) (← links)
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem (Q1197011) (← links)
- Nowhere-zero 3-flows of highly connected graphs (Q1208358) (← links)
- Upper-embeddable graphs and related topics (Q1255963) (← links)
- Upper embeddability and connectivity of graphs (Q1257900) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- \(k\)-connectivity and decomposition of graphs into forests (Q1343147) (← links)
- Antisymmetric flows and edge-connectivity (Q1422419) (← links)
- On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs (Q1569047) (← links)
- Maximum genus, girth and connectivity (Q1580675) (← links)
- The connectivity of acyclic orientation graphs (Q1584217) (← links)
- Lower bounds on the maximum genus of loopless multigraphs (Q1595253) (← links)
- Packing spanning trees in highly essentially connected graphs (Q1618210) (← links)
- Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609) (← links)
- The maximum genus of a 3-regular simplicial graph (Q1807872) (← links)
- A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (Q1864218) (← links)
- Maximum genus and connectivity (Q1910565) (← links)
- A tight lower bound on the maximum genus of a simplicial graph (Q1923508) (← links)
- Antiparallel \(d\)-stable traces and a stronger version of ore problem (Q2014350) (← links)
- Edge-disjoint spanning trees and forests of graphs (Q2028071) (← links)
- On the extended Clark-Wormold Hamiltonian-like index problem (Q2075501) (← links)
- Packing plane spanning trees into a point set (Q2206739) (← links)
- The maximum genus of graphs of diameter two (Q2276970) (← links)
- Spanning tree packing number and eigenvalues of graphs with given girth (Q2321370) (← links)
- On chromatic number and minimum cut (Q2338633) (← links)
- Heffter arrays and biembedding graphs on surfaces (Q2341067) (← links)
- A flow theory for the dichromatic number (Q2403695) (← links)
- Up-embeddability of a graph by order and girth (Q2464047) (← links)
- Results of the maximum genus of graphs (Q2475314) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Edge-disjoint Steiner trees and connectors in graphs (Q2701394) (← links)
- On factors of 4-connected claw-free graphs (Q2744573) (← links)
- An Eulerian exposition (Q3204499) (← links)
- Edge Partition of Toroidal Graphs into Forests in Linear Time (Q3439375) (← links)
- (Q4022063) (← links)
- (Q4886767) (← links)
- PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS (Q5237541) (← links)
- (Q5708581) (← links)
