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

On the maximum number of diagonals of a circuit in a graph

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

DOI10.1016/0012-365X(80)90097-7zbMath0468.05047MaRDI QIDQ1156149

Ram Prakash Gupta, Neil Robertson, Jeffry Kahn

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

diagonalscircuits


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)


Related Items (3)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ The maximum number of diagonals of a cycle in a block and its extremal graphs ⋮ The maximum number of diagonals of a cycle in a block



Cites Work

  • Parallel concepts in graph theory
  • Minimally 2-connected graphs.
  • On Minimal Blocks
  • Unnamed Item


This page was built for publication: On the maximum number of diagonals of a circuit in a graph

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