A degree condition for diameter two orientability of graphs (Q1727780): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Diameter of orientations of graphs with given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A size condition for diameter two orientable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented diameter of graphs with given maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Oriented Diameter of a Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: AT-free graphs: Linear bounds for the oriented diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating the oriented diameter of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientations of digraphs almost preserving diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of an orientation of a complete multipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum diameter of orientations of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal orientations of Cartesian products with a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal orientations of Cartesian products of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal orientations of graphs and digraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the minimum oriented diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented diameter of graphs with diameter 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Graphs, with an Application to a Problem of Traffic Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bound on the oriented diameter of graphs with given minimum degree / rank
 
Normal rank

Revision as of 08:10, 18 July 2024

scientific article
Language Label Description Also known as
English
A degree condition for diameter two orientability of graphs
scientific article

    Statements

    A degree condition for diameter two orientability of graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2019
    0 references
    distance
    0 references
    diameter
    0 references
    orientation
    0 references
    oriented diameter
    0 references
    minimum degree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references