Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Contractible Edges and Contractible Triangles in a 3-Connected Graph
by
Kiyoshi Ando
, Yoshimi Egawa
in
Combinatorics
/ Engineering Design
/ Graph theory
/ Mathematics
/ Mathematics and Statistics
/ Original Paper
2021
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Contractible Edges and Contractible Triangles in a 3-Connected Graph
by
Kiyoshi Ando
, Yoshimi Egawa
in
Combinatorics
/ Engineering Design
/ Graph theory
/ Mathematics
/ Mathematics and Statistics
/ Original Paper
2021
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Contractible Edges and Contractible Triangles in a 3-Connected Graph
Journal Article
Contractible Edges and Contractible Triangles in a 3-Connected Graph
2021
Request Book From Autostore
and Choose the Collection Method
Overview
Let
G
be a 3-connected graph. An edge (a triangle) of
G
is said to be a 3-contractible edge (a 3-contractible triangle) if the contraction of it results in a 3-connected graph. We denote by
E
c
(
G
)
and
T
c
(
G
)
the set of 3-contractible edges of
G
and the set of 3-contractible triangles of
G
, respectively. We prove that if
|
V
(
G
)
|
≥
7
, then
|
E
c
(
G
)
|
+
15
14
|
T
c
(
G
)
|
≥
6
7
|
V
(
G
)
|
.
We also determine the extremal graphs.
Publisher
Springer Science and Business Media LLC,Springer Japan,Springer Nature B.V
This website uses cookies to ensure you get the best experience on our website.