Claw‐decompositions and tutte‐orientations
From MaRDI portal
Publication:5471011
DOI10.1002/jgt.20149zbMath1117.05088OpenAlexW4235338656MaRDI QIDQ5471011
Carsten Thomassen, János Barát
Publication date: 6 June 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20149
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (max. 100)
Packing spanning trees in highly essentially connected graphs ⋮ Two equivalent properties of \(\mathcal Z_3\)-connectivity ⋮ Path decompositions of regular graphs with prescribed girth ⋮ Decompositions of highly connected graphs into paths of any given length ⋮ Decompositions of highly connected graphs into paths of length five ⋮ Random 4-regular graphs have 3-star decompositions asymptotically almost surely ⋮ The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture ⋮ Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Spanning triangle-trees and flows of graphs ⋮ Nowhere-zero 3-flow of graphs with small independence number ⋮ Edge-partitioning 3-edge-connected graphs into paths ⋮ Edge‐decomposing graphs into coprime forests ⋮ Graph factors modulo \(k\) ⋮ Edge-decomposition of graphs into copies of a tree with four edges ⋮ On star decompositions of random regular graphs ⋮ Decomposing graphs into paths and trees ⋮ A cube dismantling problem related to bootstrap percolation ⋮ The weak 3-flow conjecture and the weak circular flow conjecture ⋮ On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ Decomposing a graph into bistars ⋮ Decomposing graphs into paths of fixed length ⋮ A proof of the Barát-Thomassen conjecture ⋮ Pack graphs with subgraphs of size three ⋮ Decomposing highly connected graphs into paths of length five ⋮ Nowhere-zero 3-flows in triangularly connected graphs ⋮ Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs ⋮ What is on his mind? ⋮ Locally self-avoiding Eulerian tours ⋮ Decompositions of highly connected graphs into paths of length 3 ⋮ Orienting Triangulations ⋮ Edge-decompositions of highly connected graphs into paths ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees ⋮ Star decomposition of graphs ⋮ The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
Cites Work
This page was built for publication: Claw‐decompositions and tutte‐orientations
