Sparse graph certificates for mixed connectivity

DOI10.1016/J.DISC.2004.11.011zbMATH Open1062.05082OpenAlexW2169333450MaRDI QIDQ1781979FDOQ1781979

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

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

zbMATH Keywords

Greedy forestLegal orderingMixed connectivity certificateMixed cut

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

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

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)