Sparse graph certificates for mixed connectivity

DOI10.1016/J.DISC.2004.11.011MaRDI QIDQ1781979zbMATH OpenOpenAlexFDO

Authors Ottilia Fülöp

Publication date 10 June 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.11.011

zbMATH Keywords

Greedy forestLegal orderingMixed connectivity certificateMixed cut

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• On mixed connectivity certificates
• On mixed connectivity certificates
• Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
• On sparse subgraphs preserving connectivity properties
• scientific article; zbMATH DE number 1303037

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• A theorem on n-connected graphs
• Existenz gewisser Konfigurationen in n-gesättigten Graphen und in Graphen genügend großer Kantendichte
• Minimally n-line connected graphs.
• On mixed connectivity certificates
• On sparse subgraphs preserving connectivity properties
• Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
• \(k\)-connectivity and decomposition of graphs into forests

Cited in

(2)

• Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
• On mixed connectivity certificates

This page was built for publication: Sparse graph certificates for mixed connectivity

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