Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Cycles through five edges in 3-connected cubic graphs

From MaRDI portal
Publication:581414
Jump to:navigation, search

DOI10.1007/BF01788553zbMath0627.05035MaRDI QIDQ581414

R. E. L. Aldred, Derek Holton

Publication date: 1987

Published in: Graphs and Combinatorics (Search for Journal in Brave)


zbMATH Keywords

cycle3-connected cubic graphcommon cyclefive edges


Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)


Related Items (2)

Circumference of 3-connected cubic graphs ⋮ Cycles through edges in cyclically \(k\)-connected cubic graphs




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Cycles through four edges in 3-connected cubic graphs
  • Girth in graphs
  • A nine point theorem for 3-connected graphs
  • Circuits through specified edges
  • Cycles through ten vertices in 3-connected cubic graphs




This page was built for publication: Cycles through five edges in 3-connected cubic graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:581414&oldid=12475204"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 07:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki