On the minimal length of the longest trail in a fixed edge-density graph
Main Author: | Szécsi Vajk |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2013-10-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.2478/s11533-013-0285-x |
Similar Items
-
Bounds on F-index of tricyclic graphs with fixed pendant vertices
by: Akram Sana, et al.
Published: (2020-03-01) -
More about sparse halves in triangle-free graphs
by: Razborov, A.A
Published: (2022) -
Turán Function and H-Decomposition Problem for Gem Graphs
by: Liu Henry, et al.
Published: (2018-08-01) -
On the longest path in a recursively partitionable graph
by: Julien Bensmail
Published: (2013-01-01) -
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
by: Shyu Tay-Woei
Published: (2021-05-01)