Light edges in degree-constrained graphs

DOI10.1016/j.disc.2003.12.003zbMath1042.05078OpenAlexW2106389765MaRDI QIDQ1827725

David R. Wood, Prosenjit Bose, Michiel H. M. Smid

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.12.003

zbMATH Keywords

MatchingGraphLight edge

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

3-paths in graphs with bounded average degree ⋮ Tree densities in sparse graph classes ⋮ Remarks on proper conflict-free colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the total coloring of planar graphs.
• Optimal Search in Planar Subdivisions
• On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
• On a max-min problem concerning weights of edges

This page was built for publication: Light edges in degree-constrained graphs