On a conjecture concerning the orientation number of a graph (Q1024476): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123009357 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.02.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117318161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbins's Theorem for Mixed Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3353039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing and maximizing the diameter in orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orientation number of two complete graphs with linkages / 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 of even cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal orientations of products of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal orientations of Cartesian products of even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal orientations of Cartesian products of graphs. I / 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 graphs. II: Complete graphs and even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal orientations of \(G\) vertex-multiplications / 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: On a conjecture concerning optimal orientations of the Cartesian product of a triangle and an odd cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter-preserving orientations of the torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientations of the n-cube with minimum diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diametrically critical tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every vertex a king / 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: Q3754023 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:48, 1 July 2024

scientific article
Language Label Description Also known as
English
On a conjecture concerning the orientation number of a graph
scientific article

    Statements

    On a conjecture concerning the orientation number of a graph (English)
    0 references
    0 references
    17 June 2009
    0 references
    0 references
    digraph
    0 references
    optimal orientation
    0 references
    orientation number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references