Large degree vertices in longest cycles of graphs, II
In this paper, we consider the least integer d such that every k-connected graph G of order n (and of independent number α) has a longest cycle containing all vertices of degree at least d. We completely determine the d when k = 2. We propose a conjecture for those k-connected graph, where k ≥ 3....
Saved in:
Main Authors: | , , |
---|---|
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2019-10-10.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |