REORIENTATIONS OF COVERING GRAPHS

被引：0
|
作者：
BRIGHTWELL, G [1 ]
NESETRIL, J [1 ]
机构：
[1] CHARLES UNIV,KAM MFF,DEPT APPL MATH,CS-11800 PRAGUE 1,CZECHOSLOVAKIA
来源：
DISCRETE MATHEMATICS | 1991年 / 88卷 / 2-3期
关键词：
D O I：
10.1016/0012-365X(91)90004-L
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The aim of this paper is to construct a graph G on n vertices which is a connected covering graph but has 2-degrees-(n) diagram orientations. This provides a negative answer to a question of I. Rival.
引用
收藏
页码：129 / 132
页数：4
相关论文
共 50 条
  • [21] Covering Arrays on Product Graphs
    Akhtar, Yasmeen
    Maity, Soumen
    GRAPHS AND COMBINATORICS, 2017, 33 (04) : 635 - 652
  • [22] Covering Arrays on Product Graphs
    Yasmeen Akhtar
    Soumen Maity
    Graphs and Combinatorics, 2017, 33 : 635 - 652
  • [23] EMBEDDINGS OF COVERING PROJECTIONS OF GRAPHS
    CLARKE, FW
    THOMAS, AD
    WALLER, DA
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1980, 28 (01) : 10 - 17
  • [24] Packing and covering dense graphs
    Alon, N
    Caro, Y
    Yuster, R
    JOURNAL OF COMBINATORIAL DESIGNS, 1998, 6 (06) : 451 - 472
  • [25] Multiple Kronecker covering graphs
    Imrich, Wilfried
    Pisanski, Tomaz
    EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (05) : 1116 - 1122
  • [26] Covering Italian domination in graphs
    Khodkar, Abdollah
    Mojdeh, Doost Ali
    Samadi, Babak
    Yero, Ismael G.
    Discrete Applied Mathematics, 2021, 304 : 324 - 331
  • [27] Packing and covering triangles in graphs
    Discrete Math, 1-3 (251-254):
  • [28] Packing and covering triangles in graphs
    Haxell, PE
    DISCRETE MATHEMATICS, 1999, 195 (1-3) : 251 - 254
  • [29] On edge covering colorings of graphs
    Zhang, Xia
    Liu, Guizhen
    INFORMATION PROCESSING LETTERS, 2011, 111 (20) : 1004 - 1006
  • [30] A COVERING PROBLEM IN THE ODD GRAPHS
    SOLE, P
    GHAFOOR, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 357 : 396 - 406
12345