Weights of induced subgraphs in K₁,r-free graphs
From MaRDI portal
Publication:442341
Recommendations
Cites work
- scientific article; zbMATH DE number 426346 (Why is no real title available?)
- scientific article; zbMATH DE number 4156458 (Why is no real title available?)
- scientific article; zbMATH DE number 125461 (Why is no real title available?)
- scientific article; zbMATH DE number 3504992 (Why is no real title available?)
- Acyclic colorings of planar graphs
- Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
- Claw-free graphs---a survey
- Connected subgraphs with small degree sums in 3-connected planar graphs
- Extending Kotzig's theorem
- Light paths in 4-connected graphs in the plane and other surfaces
- On \(3\)-connected plane graphs without triangular faces
- On a max-min problem concerning weights of edges
- On light cycles in plane triangulations
- On weights of induced paths and cycles in claw-free and \(K_{1,r}\)-free graphs
- Strengthening of a theorem about 3-polytopes
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- Subgraphs with restricted degrees of their vertices in planar graphs
Cited in
(2)
This page was built for publication: Weights of induced subgraphs in \(K_{1,r}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442341)