Computing the largest bond of a graph

DOI10.4230/LIPICS.IPEC.2019.12MaRDI QIDQ5875544zbMATH OpenOpenAlexFDO

Authors Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1910.01071

zbMATH Keywords

bondclique-widthconnected cutcutFPTmaximum cuttreewidth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Recommendations

• Computing the largest bond and the maximum connected cut of a graph
• Computing the binding number of a graph
• Computing giant graph diameters
• Intersections of largest bonds in \(k\)-connected graphs
• On deletions of largest bonds in graphs
• Computing the degeneracy of large graphs
• Computing the Strength of a Graph
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Efficient bondage number of a graph
• Finding maximum subgraphs with relatively large vertex connectivity

Cited in

(6)

• Intersections of largest bonds in \(k\)-connected graphs
• Finding a maximum minimal separator: graph classes and fixed-parameter tractability
• Computing the largest bond and the maximum connected cut of a graph
• More applications of the d-neighbor equivalence: acyclicity and connectivity constraints
• Induced tree covering and the generalized Yutsis property
• Induced tree covering and the generalized Yutsis property

This page was built for publication: Computing the largest bond of a graph

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