scientific article; zbMATH DE number 3523603

zbMATH Open0335.05124MaRDI QIDQ4101857FDOQ4101857

Authors: V. P. Polesskij, Michael V. Lomonosov 

Publication date: 1972

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05)

Cited In (7)

• Note on an extremal problem arising for unreliable networks in parallel computing
• Sparse reliable graph backbones
• Counting almost minimum cutsets with reliability applications
• A certain polynomial of a graph and graphs with an extremal number of trees
• Edge-packings of graphs and network reliability
• On graphs with randomly deleted edges
• Reliable assignments of processors to tasks and factoring on matroids

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