Minimal oriented graphs of diameter 2
From MaRDI portal
Publication:1272532
DOI10.1007/S003730050022zbMath0917.05033OpenAlexW1971489728MaRDI QIDQ1272532
Chandra M. Pareek, Peter Horák, Xuding Zhu, Zoltan Fueredi
Publication date: 2 August 1999
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050022
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Extremal combinatorics (05D99)
Related Items (11)
Homomorphisms and colourings of oriented graphs: an updated survey ⋮ Minimum average distance of strong orientations of graphs ⋮ Rainbow Saturation and Graph Capacities ⋮ A size condition for diameter two orientable graphs ⋮ Complete oriented colourings and the oriented achromatic number ⋮ On the oriented achromatic number of graphs ⋮ A homomorphic polynomial for oriented graphs ⋮ On the sizes of graphs and their powers: the undirected case ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks ⋮ Outerplanar and Planar Oriented Cliques ⋮ On complexity of round transformations
This page was built for publication: Minimal oriented graphs of diameter 2
