Pith. sign in

REVIEW 1 cited by

Graphs whose all maximal induced forests are of the same order

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 2105.14339 v1 pith:QNHN7DAE submitted 2021-05-29 math.CO

Reza Jafarpour-Golzari This is my paper · ORCID
classification math.CO
keywords graphsforestsinducedorderwell-f-coveredwhoseboundarycharacterize
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, a new concept in graphs namely well-f-coveredness is introduced. We characterize all graphs with such property, whose maximum induced forests are of boundary order. Also we prove several propositions concerning with obtaining large well-f-covered graphs from smaller ones. By the way, some interesting classes of well-f-covered graphs are characterized.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Multilingual Neural Machine Translation via Corpus-Driven Vocabulary Pruning: An English-Arabic Case Study

    cs.CL 2026-08 conditional novelty 5.0 of 10

    Pruning multilingual NMT vocabularies to corpus-relevant tokens plus fine-tuning cuts memory by about 60% and matches or beats a dedicated English-Arabic model on COMET and TER.

Pith tools