Two path extremal graphs and an application to a Ramsey-type problem
From MaRDI portal
(Redirected from Publication:1297399)
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- Comparisons of Bayesian estimation procedures for two-way contingency tables without interaction
- Graph theory
- Graphs with maximal number of adjacent pairs of edges
Cited in
(11)- Extremality of degree-based graph entropies
- Nonexistence of uniformly most reliable two-terminal graphs
- Maximizing the degree powers of graphs with fixed size
- The average diameter and its estimation in nonlinear structures
- On the construction of locally most reliable two-terminal graphs
- An Extremal Problem of Graphs with Diameter 2
- On the connectivity of extremal Ramsey graphs
- An extremal problem for paths in bipartite graphs
- On locally most reliable three-terminal graphs of sparse 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\(|)\)
- Uniformly most reliable three-terminal graph of dense graphs
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)
