A note on k-strongly connected orientations of an undirected graph

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Each k-strongly connected orientation of an undirected graph can be obtained from any other k-strongly connected orientation by reserving consecutively directed paths or circuits without destroying the k-strongly connectivity.

Original languageEnglish
Pages (from-to)103-104
Number of pages2
JournalDiscrete Mathematics
Volume39
Issue number1
DOIs
Publication statusPublished - 1982

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this