Weights of induced subgraphs in K₁,r-free graphs
From MaRDI portal
Publication:442341
DOI10.1016/J.DISC.2012.04.025zbMATH Open1246.05107OpenAlexW2077757926MaRDI QIDQ442341FDOQ442341
Authors: Anja Pruchnewski, Margit Voigt 
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.025
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Claw-free graphs---a survey
- Acyclic colorings of planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending Kotzig's theorem
- On a max-min problem concerning weights of edges
- On light cycles in plane triangulations
- Title not available (Why is that?)
- Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
- On \(3\)-connected plane graphs without triangular faces
- 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
- On weights of induced paths and cycles in claw-free and \(K_{1,r}\)-free graphs
- Title not available (Why is that?)
- Connected subgraphs with small degree sums in 3-connected planar graphs
- Light paths in 4-connected graphs in the plane and other surfaces
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)
