Hetyei, Gábor (2001) Cyclic connectivity classes of directed graphs. ACTA MATHEMATICA ACADEMIAE PAEDAGOGICAE NYÍREGYHÁZIENSIS, 17 (2). pp. 47-60. ISSN 0866-0174
|
Text
amapn17_9.pdf Download (173kB) | Preview |
Official URL: http://www.emis.de/journals/AMAPN/index.html
Abstract
We show that most connectivity types of simple directed graphs defined by A. Ádám in [1] are nonempty. The nonexistence of the three types that remain missing is the consequence of a fairly plausible conjecture, stated at the end of this paper.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Directed graphs; Theory of graphs; Cyclic connectivity properties; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 29 Jan 2024 10:05 |
| Last Modified: | 29 Jan 2024 10:05 |
| URI: | http://real.mtak.hu/id/eprint/186511 |
Actions (login required)
 |
Edit Item |
