Math 2.0

Resources / preprint

Two-edge-connected (not necessarily spanning) subgraphs and polyhedra MC8ZBZ14PM

URIm2://res/MC8ZBZ14PM
Kindpreprint
CreatorsJustus Bruckamp, Markus Chimani, Martina Juhnke
Date2024-10-24
MSC05-XX
Subjectsarxiv math.CO
Scopein

Expressions

e1: version, preprint

Languageen
Date2024-10-24
IdsarXiv 2410.18564, zbl_id 902590511

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
10CNS7AG0Kstatementtheorem 3.2arxiv
3PE841CYQJstatementfact 2.3arxiv
4G2WGVMP8Xstatementtheorem 2.6arxiv
4KHV0XXTFQstatementfact 3.3arxiv
674EWDFXQ7statementtheorem 6.3arxiv
833CKGPQGZstatementtheorem 2.8arxiv
873T1J7VJ7statementtheorem 3.4arxiv
8D0H9AR6TAstatementtheorem 3.5arxiv
8Z4HXW9Z80definitiondefinition 2.1arxiv
C7YVKN95WXstatementtheorem 3.7arxiv
CAMTY80NZ2statementtheorem 3.8arxiv
ED3H8SC8CZproblemproblem 5.1arxiv
JNYMQK5TQ0problemproblem 5.3arxiv
M4MA6X2D5Wstatementtheorem 3.1arxiv
MB1RHJP6XFstatementtheorem 3.6arxiv
N9N1C93N9Jstatementtheorem 6.4arxiv
PJ32AZPV7Gproblemproblem 5.2arxiv
RFTWNQQ8R5statementtheorem 6.2arxiv
RH9KGPVWSWstatementfact 2.5arxiv
RJ7FHHN40Xstatementfact 2.4arxiv
Y8FHW8ZWGFstatementfact 2.2arxiv
ZHHPW3GKQRstatementtheorem 6.1arxiv

Catalogue records