Potentially 2-connected integer pair sequences (Q1088689): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Zhanna A. Chernyak / rank | |||
Property / reviewed by | |||
Property / reviewed by: Rainer Bodendiek / rank | |||
Property / author | |||
Property / author: Zhanna A. Chernyak / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Rainer Bodendiek / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3929766 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relations between graphs and integer-pair sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3937452 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3931446 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3039400 / rank | |||
Normal rank |
Revision as of 18:46, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Potentially 2-connected integer pair sequences |
scientific article |
Statements
Potentially 2-connected integer pair sequences (English)
0 references
1986
0 references
This paper deals with topics concerning edge sequences and their realizations, which were treated for example in \textit{A. N. Patrinos'} and \textit{S. L. Hakimi}'s joint paper in Discrete Math. 15, 347-358 (1976; Zbl 0328.05139), \textit{N. Achuthan}'s paper in Combinatorics and graph theory, Proc. Symp., Calcutta 1980, Lect. Notes Math. 885, 153-164 (1981; Zbl 0481.05058), or in the author's paper in Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk 1982, No.3, 43-47 (1982; Zbl 0499.05050). In this paper the author solves the problem of characterization of potentially 2-connected edges sequences by giving a polynomial algorithm for verifying the potential 2-connectivity of an edge sequence and by proving an existence theorem for potentially 2-connected edge sequences. He finishes his paper by formulating a hypothesis on edge sequences being potentially n-connected (n\(\geq 2)\).
0 references
2-connectivity
0 references
edge sequences
0 references