Edge-diameter of a graph and its longest cycles

DOI10.1007/S00373-023-02691-3zbMATH Open1526.05043OpenAlexW4385496972MaRDI QIDQ6133658FDOQ6133658

Authors: Lei Zhang, Liming Xiong, Jianhua Tu 

Publication date: 21 August 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-023-02691-3

Recommendations

• scientific article; zbMATH DE number 7296016
• Relative length of longest paths and cycles in 2-connected graphs
• Circumference of a graph and its distance dominating longest cycles
• Relative length of longest paths and cycles in 3-connected graphs
• scientific article; zbMATH DE number 426167

zbMATH Keywords

diametercyclesdistance dominating cyclecircumference, simple graphsedge diameter

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Some Theorems on Abstract Graphs
• Title not available (Why is that?)
• Existence of dominating cycles and paths
• Forbidden pairs and the existence of a dominating cycle
• A degree sum condition with connectivity for relative length of longest paths and cycles
• On the circumference of 3-connected graphs
• Existence of Δλ-cycles and Δλ-paths
• A result on Hamiltonian line graphs involving restrictions on induced subgraphs
• A note on distance-dominating cycles
• Circumference of a graph and its distance dominating longest cycles
• On the line graph of a graph with diameter 2

Cited In (1)

• The number of edges in a maximum cycle-distributed graph

This page was built for publication: Edge-diameter of a graph and its longest cycles

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