Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.

MaRDI QIDQ2716020zbMATH OpenFDO

Authors Toru Kojima, Kiyoshi Ando

Publication date 20 July 2005

Published in Ars Combinatoria (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Wide-diameter and minimum length of fan
• On the minimum 2-wide diameter of cycles with chords
• Edge-wide-diameter of graphs with diameter d
• Wide diameter and diameter of networks.
• On generalized wide diameter of graphs.

Cited in

(5)

• A look at cycles containing specified elements of a graph
• An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement
• Wide-diameter and minimum length of fan
• On the minimum 2-wide diameter of cycles with chords
• Containers and wide diameters of \(P_3(G)\).

This page was built for publication: Minimum length of cycles through specified vertices in graphs with wide-diameter at most \(d\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2716020)