scientific article; zbMATH DE number 512927

MaRDI QIDQ4281641zbMATH OpenFDO

Authors Efim Dinitz

Publication date 10 March 1994

zbMATH Keywords

3-cutscomponentsfactor-graphgraph invariantpartition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• On the structure of a 3-connected graph. II
• An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
• A simple 3-edge-connected component algorithm
• 3-restricted edge cut of graphs
• Edge-cuts leaving components of order at least three

Cited in

(7)

• The structure of a decomposition of a triconnected graph
• On the structure of a 3-connected graph. II
• scientific article; zbMATH DE number 4057549 (Why is no real title available?)
• On 2-strong connectivity orientations of mixed graphs and related problems
• Computing the 4-edge-connected components of a graph: an experimental study
• On maximal k-edge-connected subgraphs of undirected graphs
• On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs

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