SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257zbMATH Open1175.05106OpenAlexW2756057450MaRDI QIDQ5898005FDOQ5898005

Grazyna Zwozniak

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11611257

Recommendations

• Parameterized edge dominating set in cubic graphs (extended abstract)
• Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
• Parameterized edge dominating set in graphs with degree bounded by 3
• Maximum matching and kernelization of edge dominating set
• Algorithmic aspects of upper edge domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (2)

• Minimum maximal matchings in cubic graphs
• The greedy algorithm for domination in graphs of maximum degree 3

This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898005)