Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Complementary Pairs of Graphs Orientable to Line Digraphs

Zoran Radosavijevic1, Slobodan Simic1, Zsolt Tuza2
1Department of Mathematics, Faculty of Electrical Engineering University of Belgrade Bulevar Revolucije 73 11000 Belgrade Serbia, Yugoslavia
2Computer and Automation Institute Hungarian Academy of Sciences H-1111 Budapest, Kende u. 13-17 Hungary
  • Published: 30/04/1993

Abstract

A graph is orientable to a line digraph (OLD, for short) if its lines can be oriented in such a way that the resulting digraph is the line digraph of some digraph. In this paper, we find all graphs such that both the graph and its complement are OLD and also characterize these graphs in terms of minimal forbidden subgraphs. As shown, all of these graphs have at most nine points.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Zoran Radosavijevic, Slobodan Simic, Zsolt Tuza. Complementary Pairs of Graphs Orientable to Line Digraphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 013. 65-75. DOI: .