Some results on graphs without long induced paths

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199605)22:1<23::AID-JGT4>3.0.CO;2-N" /><23::AID-JGT4>3.0.CO;2-N 10.1002/(SICI)1097-0118(199605)22:1<23::AID-JGT4>3.0.CO;2-NzbMath0849.05046OpenAlexW2078467531MaRDI QIDQ4879162

Jinquan Dong

Publication date: 22 May 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199605)22:1<23::aid-jgt4>3.0.co;2-n

zbMATH Keywords

distancedominate\(m\)-centerlong induced paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (2)

Infinite versus finite graph domination ⋮ Complete description of forbidden subgraphs in the structural domination problem

This page was built for publication: Some results on graphs without long induced paths