Math 2.0

Resources / preprint

On graphs whose powers are well-covered JP589KS01S

URIm2://res/JP589KS01S
Kindpreprint
CreatorsMy Hanh Pham, Thanh Vu
Date2026-10-07
MSC05-XX
Subjectsarxiv math.CO
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-07
IdsarXiv 2610.09300

Items in this resource

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

ItemKindWhereSource
422Z2KYYQJstatementcorollary 3.5arxiv
Very well-covered graphsstatementtheorem 3.3arxiv
6BQ87HMW46definitiondefinition 3.1arxiv
8FGK92CTRPproblemproblem 1.1arxiv
8KC3JC56X6definitiondefinition 2.4arxiv
8NDC642B0Pstatementlemma 3.4arxiv
B09SW91RX8statementlemma 2.5arxiv
Independent Sets, Vertex Covers, and Well-Coverednessdefinitiondefinition 2.3arxiv
BY615SGHPXproblemproblem 3.9arxiv
CX57P6AZQ5definitiondefinition 1.5arxiv
Well-covered chordal graphsstatementtheorem 3.2arxiv
DT89RWQGXCstatementcorollary 2.6arxiv
GTGFBYWXM2statementtheorem 1.6arxiv
HZWX0AZEP4statementlemma 2.7arxiv
M5AK6ZPDCEexampleexample 3.8arxiv
MJVKDQ5WF6statementproposition 3.6arxiv
R8QHWNQERBstatementtheorem 1.3arxiv
Distance and Graph Powersdefinitiondefinition 2.2arxiv
RZEKMDB8BQexampleexample 3.7arxiv
S0GP2CQH7Rdefinitiondefinition 2.1arxiv
SZ3AM9MBMFstatementtheorem 1.4arxiv
ZYR37WYRDPstatementtheorem 1.2arxiv

Catalogue records