Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Biased graphs with no two vertex-disjoin...

Chen, Rong...

Free

Share this content

Biased graphs with no two vertex-disjoint unbalanced cycles by Chen, Rong ( Author )

Content Provider	Lemonjar Open Access
Publisher	Australian National University
Publication Date	01-09-2023
Summary	Lov\'asz has completely characterised the structure of graphs with no two vertex-disjoint cycles, while Slilaty has given a structural characterisation of graphs with no two vertex-disjoint odd cycles; his result is in fact more general, describing signed graphs with no two vertex-disjoint negative cycles. A biased graph is a graph with a distinguished set of cycles (called balanced) with the property that any theta subgraph does not contain exactly two balanced cycles. In this paper we characterise the structure of biased graphs with no two vertex-disjoint unbalanced cycles, answering a question by Zaslavsky and generalising the results of Lov\'asz and Slilaty.
ISBN	-
Item Type	Article
File Type	pdf
File Size	29.34 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	http://arxiv.org/abs/1403.1919

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

Chen, Rong. Biased graphs with no two vertex-disjoint unbalanced cycles. Australian National University. September 01, 2023. Accessed September 20, 2024. https://online.provdatabase.com/cite/23214

APA 7th EditionReferences

Chen, Rong. (2023). Biased graphs with no two vertex-disjoint unbalanced cycles. Australian National University. https://online.provdatabase.com/cite/23214

Chicago 17th EditionReferences

Chen, Rong. Biased graphs with no two vertex-disjoint unbalanced cycles. Australian National University. 2023. https://online.provdatabase.com/cite/23214

HarvardReferences

Chen, Rong. (2023). Biased graphs with no two vertex-disjoint unbalanced cycles. [Online]. Australian National University. Available from: https://online.provdatabase.com/cite/23214. (Accessed 20 September 2024).

Harvard AustraliaReferences

Chen, Rong, 2023, Biased graphs with no two vertex-disjoint unbalanced cycles, Australian National University, viewed 20 September 2024, <https://online.provdatabase.com/cite/23214>

MLA 9th EditionWorks Cited

Chen, Rong. Biased graphs with no two vertex-disjoint unbalanced cycles. Australian National University, 2023. PROV Database, https://online.provdatabase.com/cite/23214.

Share this eBook