Title: | A note on acyclic number of planar graphs |
---|
Authors: | ID Petruševski, Mirko (Author) ID Škrekovski, Riste (Author) |
Files: | RAZ_Petrusevski_Mirko_i2017.pdf (227,50 KB) MD5: 16221246B7AECF9331577AC35E4236C8
|
---|
Language: | English |
---|
Work type: | Unknown |
---|
Typology: | 1.01 - Original Scientific Article |
---|
Organization: | ZUP - University of Primorska Press
|
---|
Abstract: | The acyclic number ▫$a(G)$▫ of a graph ▫$G$▫ is the maximum order of an induced forest in ▫$G$▫. The purpose of this short paper is to propose a conjecture that ▫$a(G)\geq \left( 1-\frac{3}{2g}\right)n$▫ holds for every planar graph ▫$G$▫ of girth ▫$g$▫ and order ▫$n$▫, which captures three known conjectures on the topic. In support of this conjecture, we prove a weaker result that ▫$a(G)\geq \left( 1-\frac{3}{g} \right)n$▫ holds. In addition, we give a construction showing that the constant ▫$\frac{3}{2}$▫ from the conjecture cannot be decreased. |
---|
Keywords: | induced forest, acyclic number, planar graph, girth |
---|
Year of publishing: | 2017 |
---|
Number of pages: | str. 317-322 |
---|
Numbering: | Vol. 13, no. 2 |
---|
PID: | 20.500.12556/RUP-17628 |
---|
UDC: | 519.17 |
---|
ISSN on article: | 1855-3966 |
---|
COBISS.SI-ID: | 2048439059 |
---|
Publication date in RUP: | 03.01.2022 |
---|
Views: | 976 |
---|
Downloads: | 16 |
---|
Metadata: | |
---|
:
|
Copy citation |
---|
| | | Average score: | (0 votes) |
---|
Your score: | Voting is allowed only for logged in users. |
---|
Share: | |
---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |