scientific article; zbMATH DE number 867677

zbMATH Open0840.05089MaRDI QIDQ4873789FDOQ4873789

Authors: K. S. Bagga, Marc J. Lipman, L. W. Beineke, Raymond E. Pippert 

Publication date: 21 April 1996

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4112609
• scientific article; zbMATH DE number 866671
• An algorithm for the computation of edge integrity, \(I^\prime(T)\)
• scientific article; zbMATH DE number 4043858
• Edge-integrity: A survey

zbMATH Keywords

algorithmscomplexitycyclescactivulnerabilityedge-integrity of treesedge-separation sequence

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (3)

• Proper interval graph extention problems of the complements of trees
• A blossoming algorithm for tree volumes of composite digraphs
• Title not available (Why is that?)

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 Q4873789)