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

Undirected Graph
Networks (circuits)
Connectivity
Path

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

A note on k-strongly connected orientations of an undirected graph. / Frank, A.

In: Discrete Mathematics, Vol. 39, No. 1, 1982, p. 103-104.

Research output: Contribution to journalArticle

@article{ac01c94c93ba46f697e52c62c886bc27,
title = "A note on k-strongly connected orientations of an undirected graph",
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.",
author = "A. Frank",
year = "1982",
doi = "10.1016/0012-365X(82)90044-9",
language = "English",
volume = "39",
pages = "103--104",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

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

AU - Frank, A.

PY - 1982

Y1 - 1982

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49049143561&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49049143561&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(82)90044-9

DO - 10.1016/0012-365X(82)90044-9

M3 - Article

VL - 39

SP - 103

EP - 104

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -