Cops and Robber on Some Families of Oriented Graphs

2019 ◽  
pp. 188-200
Author(s):  
Sandip Das ◽  
Harmender Gahlawat ◽  
Uma Kant Sahoo ◽  
Sagnik Sen
Keyword(s):  
Oriented Graphs ◽  
Cops And Robber

Cops and Robber on some families of oriented graphs

2021 ◽  
Author(s):  
Sandip Das ◽  
Harmender Gahlawat ◽  
Uma kant Sahoo ◽  
Sagnik Sen
Keyword(s):  
Oriented Graphs ◽  
Cops And Robber

Oriented graphs determined by their generalized skew spectrum

2021 ◽  
Vol 622 ◽  
pp. 316-332
Author(s):  
Lihong Qiu ◽  
Wei Wang ◽  
Wei Wang
Keyword(s):  
Oriented Graphs

scholarly journals Counting Hamilton Decompositions of Oriented Graphs

2017 ◽  
Vol 2018 (22) ◽  
pp. 6908-6933 ◽  
Author(s):  
Asaf Ferber ◽  
Eoin Long ◽  
Benny Sudakov
Keyword(s):  
Oriented Graphs ◽  
Hamilton Decompositions

scholarly journals On the oriented chromatic index of oriented graphs

2008 ◽  
Vol 57 (4) ◽  
pp. 313-332 ◽  
Author(s):  
Pascal Ochem ◽  
Alexandre Pinlou ◽  
Éric Sopena
Keyword(s):  
Chromatic Index ◽  
Oriented Graphs

scholarly journals Consecutive Colouring of Oriented Graphs

2021 ◽  
Vol 76 (4) ◽  
Author(s):  
Marta Borowiecka-Olszewska ◽  
Ewa Drgas-Burchardt ◽  
Nahid Yelene Javier-Nol ◽  
Rita Zuazua
Keyword(s):  
Planar Graphs ◽  
Maximum Degree ◽  
Bipartite Graphs ◽  
Complete Graphs ◽  
Oriented Graphs ◽  
Complete Problem ◽  
Np Complete

AbstractWe consider arc colourings of oriented graphs such that for each vertex the colours of all out-arcs incident with the vertex and the colours of all in-arcs incident with the vertex form intervals. We prove that the existence of such a colouring is an NP-complete problem. We give the solution of the problem for r-regular oriented graphs, transitive tournaments, oriented graphs with small maximum degree, oriented graphs with small order and some other classes of oriented graphs. We state the conjecture that for each graph there exists a consecutive colourable orientation and confirm the conjecture for complete graphs, 2-degenerate graphs, planar graphs with girth at least 8, and bipartite graphs with arboricity at most two that include all planar bipartite graphs. Additionally, we prove that the conjecture is true for all perfect consecutively colourable graphs and for all forbidden graphs for the class of perfect consecutively colourable graphs.

scholarly journals MANAGEMENT OF ECOLOGICAL AND ECONOMIC ACTIVITIES OF ORGANIZATION SYSTEMS USING ORIENTED GRAPHS

2021 ◽  
pp. 63-73
Author(s):  
Tamara V. Kiseleva ◽  
Vladimir G. ikhailov ◽  
Yana S. Mikhailova
Keyword(s):  
Economic Activities ◽  
Oriented Graphs

scholarly journals Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs

2015 ◽  
Vol 8 (1) ◽  
pp. 147-167 ◽  
Author(s):  
Adam Berliner ◽  
Cora Brown ◽  
Joshua Carlson ◽  
Nathanael Cox ◽  
Leslie Hogben ◽  
...  
Keyword(s):  
Zero Forcing ◽  
Oriented Graphs ◽  
Path Cover ◽  
Zero Forcing Number ◽  
Maximum Nullity ◽  
Forcing Number ◽  
Path Cover Number

scholarly journals Graph-Counting Polynomials for Oriented Graphs

2018 ◽  
Vol 173 (2) ◽  
pp. 243-248
Author(s):  
David Ruelle
Keyword(s):  
Oriented Graphs
Sign in / Sign up

Export Citation Format

Share Document