Weights of induced subgraphs in \(K_{1,r}\)-free graphs

DOI10.1016/j.disc.2012.04.025zbMath1246.05107OpenAlexW2077757926MaRDI QIDQ442341

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

zbMATH Keywords

claw-free graphs\(k\)-colorable graphslight subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending Kotzig's theorem
• Strengthening of a theorem about 3-polytopes
• On light cycles in plane triangulations
• Claw-free graphs---a survey
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• On \(3\)-connected plane graphs without triangular faces
• Subgraphs with restricted degrees of their vertices in planar graphs
• On weights of induced paths and cycles in claw-free andK1,r-free graphs
• Connected subgraphs with small degree sums in 3-connected planar graphs
• Light paths in 4-connected graphs in the plane and other surfaces
• Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
• Acyclic colorings of planar graphs
• On a max-min problem concerning weights of edges

This page was built for publication: Weights of induced subgraphs in \(K_{1,r}\)-free graphs