Domination and independence number of large $2$-crossing-critical graphs

Martin Pra\v{c}ek; Maru\v{s}a Lek\v{s}e; Mihael Pa\v{c}nik; Petra Podlogar; Vesna Ir\v{s}i\v{c}

REVIEW

Domination and independence number of large $2$-crossing-critical graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.12206 v1 pith:4NMVYV6W submitted 2022-03-23 math.CO

Vesna Iršič , Maruša Lekše , Mihael Pačnik , Petra Podlogar , Martin Praček This is my paper · ORCID

classification math.CO

keywords crossing-criticalgraphsdominationindependencelargenumberattentionattracted

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

abstract

After $2$-crossing-critical graphs were characterized in 2016, their most general subfamily, large $3$-connected $2$-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.

Discussion (0). Continue with ORCID to comment.

Pith tools