scientific article; zbMATH DE number 3803489

MaRDI QIDQ4748181zbMATH OpenFDO

Authors Peter Kyš

Publication date 1980

zbMATH Keywords

critical graphsdiameteredge-disjoint pathsremoving an edge

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited in

(2)

• Constructing goal-minimally k-diametric graphs by lifts
• An efficient algorithm for testing goal-minimality of graphs

This page was built for publication:

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