Two path extremal graphs and an application to a Ramsey-type problem
From MaRDI portal
Publication:1297399
DOI10.1016/S0012-365X(98)00195-2zbMATH Open0924.05042MaRDI QIDQ1297399FDOQ1297399
Authors: Owen D. Byer
Publication date: 3 November 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55)
Cites Work
Cited In (11)
- On the construction of locally most reliable two-terminal graphs
- Extremality of degree-based graph entropies
- An Extremal Problem of Graphs with Diameter 2
- On locally most reliable three-terminal graphs of sparse graphs
- Maximizing the degree powers of graphs with fixed size
- Nonexistence of uniformly most reliable two-terminal graphs
- On the connectivity of extremal Ramsey graphs
- Uniformly most reliable three-terminal graph of dense graphs
- An extremal problem for paths in bipartite graphs
- Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent \(| Rho\)- Tau\(|\). (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges and the totally ordered pairs which maximize \(| Rho\)- Tau\(|)\)
- The average diameter and its estimation in nonlinear structures
This page was built for publication: Two path extremal graphs and an application to a Ramsey-type problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297399)