Star decomposition of graphs
From MaRDI portal
Publication:5261050
Recommendations
Cites work
- Claw-free graphs and 2-factors that separate independent vertices
- Claw‐decompositions and tutte‐orientations
- Decomposing a graph into bistars
- Decompositions of highly connected graphs into paths of length 3
- Edge-decompositions of highly connected graphs into paths
- Factors and factorizations of graphs. Proof techniques in factor theory
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Graph theory with applications
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- On Representatives of Subsets
- On partitioning the edges of graphs into connected subgraphs
- On the decomposition of a graph into stars
- The weak 3-flow conjecture and the weak circular flow conjecture
Cited in
(16)- On double-star decomposition of graphs
- scientific article; zbMATH DE number 5237247 (Why is no real title available?)
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem
- Star decompositions of cubes
- FORK-DECOMPOSITION OF DIRECT PRODUCT OF GRAPHS
- Path embedding in star graphs
- Random 4-regular graphs have 3-star decompositions asymptotically almost surely
- Linear star decomposition of lobster
- Determination of the star valency of a graph
- Mixtures of star trees and deficiency graphs
- Claw‐decompositions and tutte‐orientations
- On star decompositions of random regular graphs
- Smaller embeddings of partial \(k\)-star decompositions
- Star arboricity of graphs
- On decomposing regular graphs into isomorphic double-stars
- scientific article; zbMATH DE number 1145917 (Why is no real title available?)
This page was built for publication: Star decomposition of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261050)