Some graph classes and the Wimer edge variant

MaRDI QIDQ3615952zbMATH OpenFDO

Authors Alan C. Jamieson

Publication date 24 March 2009

zbMATH Keywords

domination numbergrids of fixed dimensionminimal cardinality of maximal induced matchingseries parallel graphssolving edge subset problemstreeunicyclic graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the Wimer method for designing edge-based algorithms
• scientific article; zbMATH DE number 969981
• Linear time algorithms for generalized edge dominating set problems
• Algorithms and Data Structures
• Linear algorithms for edge-vertex domination in trees

Cited in

(2)

• Some problems between a \(W\)-graph and its derived graphs
• scientific article; zbMATH DE number 969981 (Why is no real title available?)

This page was built for publication: Some graph classes and the Wimer edge variant

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