Document Type

Article

Publication Date

1-1-2019

Abstract

A sequence of 4-connected graphs G0,G1,.,Gn is called a (G0,Gn)-chain if each Gi (i

Publication Source (Journal or Book title)

Journal of Combinatorial Theory. Series B

First Page

341

Last Page

349

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 4
  • Usage
    • Downloads: 83
    • Abstract Views: 1
  • Captures
    • Readers: 3
see details

Share

COinS