Pages that link to "Item:Q5731396"
From MaRDI portal
The following pages link to Decomposition of Finite Graphs Into Forests (Q5731396):
Displaying 50 items.
- On the first-order edge tenacity of a graph (Q266912) (← links)
- Facial packing edge-coloring of plane graphs (Q313797) (← links)
- Fractional spanning tree packing, forest covering and eigenvalues (Q313822) (← links)
- Grünbaum colorings of triangulations on the projective plane (Q323063) (← links)
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- On globally sparse Ramsey graphs (Q393934) (← links)
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid (Q404444) (← links)
- Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
- Cyclic orderings and cyclic arboricity of matroids (Q414636) (← links)
- Balanced generic circuits without long paths (Q442309) (← links)
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits (Q442349) (← links)
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- 3-uniform hypergraphs avoiding a given odd cycle (Q452824) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Colouring edges with many colours in cycles (Q462927) (← links)
- Decomposition of bounded degree graphs into \(C_4\)-free subgraphs (Q472402) (← links)
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- Client-waiter games on complete and random graphs (Q504971) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- The coloring game on matroids (Q507509) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- Bounded direction-length frameworks (Q542392) (← links)
- An intermediate value theorem for the arboricities (Q554848) (← links)
- The tree number of a graph with a given girth (Q580352) (← links)
- A combinatorial study of the rigidity of planar structures (Q581093) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Some inequalities for the Tutte polynomial (Q627930) (← links)
- Supereulerian graphs in the graph family \(C_{2}(6,k)\) (Q628342) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- On the higher-order edge toughness of a graph (Q686452) (← links)
- The thickness and chromatic number of \(r\)-inflated graphs (Q709322) (← links)
- Locally finite graphs with ends: A topological approach. II: Applications (Q709326) (← links)
- List total arboricity of 2-degenerate graphs (Q714512) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- Group connectivity of graphs with diameter at most 2 (Q820087) (← links)
- On the toric ideals of matroids of a fixed rank (Q829621) (← links)
- Adjacency queries in dynamic sparse graphs (Q846004) (← links)
- On constructive characterizations of \((k,l)\)-sparse graphs (Q852713) (← links)
- Induced-path partition on graphs with special blocks (Q868947) (← links)
- Three ways to cover a graph (Q898135) (← links)
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs (Q906435) (← links)
- \(H(n)\)-factors in random graphs (Q945455) (← links)
- Pin-collinear body-and-pin frameworks and the molecular conjecture (Q958222) (← links)
- Degree conditions for group connectivity (Q966042) (← links)
- The generic rank of body-bar-and-hinge frameworks (Q966167) (← links)
