Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Generalizing p-goodness to ordered graphs

Alm, Jeremy F....

Free

Share this content

Generalizing p-goodness to ordered graphs by Alm, Jeremy F. ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	09-12-2014
Summary	It is known that the connected graphs that are p-good for all p are the trees. In this paper, we ask which ordered trees are order-p-good for all p.
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	http://arxiv.org/abs/1412.3071

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Alm, Jeremy F.. Generalizing p-goodness to ordered graphs. N.A. December 09, 2014. Accessed October 01, 2025. https://online.provdatabase.com/cite/18206

APA 7th EditionReferences

Alm, Jeremy F.. (2014). Generalizing p-goodness to ordered graphs. N.A. https://online.provdatabase.com/cite/18206

Chicago 17th EditionReferences

Alm, Jeremy F.. Generalizing p-goodness to ordered graphs. N.A. 2014. https://online.provdatabase.com/cite/18206

HarvardReferences

Alm, Jeremy F.. (2014). Generalizing p-goodness to ordered graphs. [Online]. N.A. Available from: https://online.provdatabase.com/cite/18206. (Accessed 01 October 2025).

Harvard AustraliaReferences

Alm, Jeremy F., 2014, Generalizing p-goodness to ordered graphs, N.A, viewed 01 October 2025, <https://online.provdatabase.com/cite/18206>

MLA 9th EditionWorks Cited

Alm, Jeremy F.. Generalizing p-goodness to ordered graphs. N.A, 2014. PROV Database, https://online.provdatabase.com/cite/18206.

Share this eBook