Math 2.0

Resources / preprint

On the Classical and Parameterized Complexity of Strong Odd Coloring V678XY1P9A

URIm2://res/V678XY1P9A
Kindpreprint
CreatorsDinabandhu Pradhan, Vaishali Sharma, Shaily Verma
Date2026-10-01
MSC05-XX
Subjectsarxiv cs.DM, arxiv math.CO
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-01
IdsarXiv 2610.01441

Items in this resource

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

ItemKindWhereSource
3E29Q989P1statementtheorem 5arxiv
5KHFTA2D5Qstatementtheorem 6arxiv
6KXRP30D57statementtheorem 4arxiv
7N31NQ7GQ7statementtheorem 10arxiv
999RAXN4D1statementlemma 3arxiv
Zuckermanstatementtheorem 2arxiv
A14M6WD0K6statementtheorem 1arxiv
Tree Decompositiondefinitiondefinition 1arxiv
DS6TBZ7PHBstatementlemma 3arxiv
G99XTHWV0Dstatementfact 1arxiv
Bodlaender et al.statementtheorem 7arxiv
MC56GYE4D2statementlemma 4arxiv
MT279PMYQMstatementfact 2arxiv
SAT6X4RFPWstatementtheorem 8arxiv
Clique-widthdefinitiondefinition 2arxiv
T38GYY8T8Kstatementtheorem 3arxiv
Fomin et al.statementtheorem 9arxiv
V26D6BMTN9statementcorollary 1arxiv
VG5VYYQRJDstatementlemma 2arxiv
YY6B2R93X2statementlemma 1arxiv

Catalogue records