Edge-diameter of a graph and its longest cycles
From MaRDI portal
Publication:6133658
DOI10.1007/s00373-023-02691-3zbMath1526.05043OpenAlexW4385496972MaRDI QIDQ6133658
Lei Zhang, Jian-hua Tu, Limning Xiong
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
Paths and cycles (05C38) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A degree sum condition with connectivity for relative length of longest paths and cycles
- A note on distance-dominating cycles
- Existence of dominating cycles and paths
- On the circumference of 3-connected graphs
- Circumference of a graph and its distance dominating longest cycles
- On the line graph of a graph with diameter 2
- Forbidden pairs and the existence of a dominating cycle
- A result on Hamiltonian line graphs involving restrictions on induced subgraphs
- Existence of Δλ-cycles and Δλ-paths
- Some Theorems on Abstract Graphs
This page was built for publication: Edge-diameter of a graph and its longest cycles