On the number of shredders

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199907)31:3<195::AID-JGT4>3.0.CO;2-E" /><195::AID-JGT4>3.0.CO;2-E 10.1002/(SICI)1097-0118(199907)31:3<195::AID-JGT4>3.0.CO;2-EzbMath0933.05077OpenAlexW4249772428MaRDI QIDQ4256091

Tibor Jordán

Publication date: 22 March 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199907)31:3<195::aid-jgt4>3.0.co;2-e

zbMATH Keywords

connectivityshredder

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (7)

Global and fixed-terminal cuts in digraphs ⋮ 5-Shredders of Contraction-Critical 5-Connected Graphs ⋮ On shredders and vertex connectivity augmentation ⋮ Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph ⋮ k-shredders ink-connected graphs ⋮ Edges not contained in triangles and the number of contractible edges in a 4-connected graph ⋮ 5-shredders in 5-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of shredders