Standard

Two-Chord Framings of Spanning Trees. / Maslova, Yu V.; Nezhinskij, V. M.

In: Journal of Mathematical Sciences (United States), Vol. 212, No. 5, 2016, p. 577-583.

Research output: Contribution to journal › Article › peer-review

Harvard

Maslova, YV & Nezhinskij, VM 2016, 'Two-Chord Framings of Spanning Trees', Journal of Mathematical Sciences (United States), vol. 212, no. 5, pp. 577-583. https://doi.org/10.1007/s10958-016-2690-8

APA

Maslova, Y. V., & Nezhinskij, V. M. (2016). Two-Chord Framings of Spanning Trees. Journal of Mathematical Sciences (United States), 212(5), 577-583. https://doi.org/10.1007/s10958-016-2690-8

Vancouver

Maslova YV, Nezhinskij VM. Two-Chord Framings of Spanning Trees. Journal of Mathematical Sciences (United States). 2016;212(5):577-583. https://doi.org/10.1007/s10958-016-2690-8

Author

Maslova, Yu V. ; Nezhinskij, V. M. / Two-Chord Framings of Spanning Trees. In: Journal of Mathematical Sciences (United States). 2016 ; Vol. 212, No. 5. pp. 577-583.

BibTeX

@article{6a56286cb78547aea276d0cf16687c4c,
title = "Two-Chord Framings of Spanning Trees",
abstract = "We find sufficient conditions under which a finite connected graph has a spanning tree with the following property. There is a numbering of edges and an injective mapping of the set of all edges of the tree to the set of all pairs of different chords (i.e., edges of the graph not contained in the tree) such that for any pair of chords in the image of the mapping, the cycles containing one chord from the pair and containing no other chords intersect along an edge in the preimage, and, maybe, along other edges of the tree with smaller numbers. The problem of study of graphs that possess this property appeared in the process of study the (isotopic) classification problem of embeddings of graphs in the 3-space. Bibliography: 3 titles.",
keywords = "Span Tree, Connected Graph, Injective Mapping, Ribbon Graph, Elementary Cycle",
author = "Maslova, {Yu V.} and Nezhinskij, {V. M.}",
note = "Maslova, Y.V., Nezhinskij, V.M. Two-Chord Framings of Spanning Trees. J Math Sci 212, 577–583 (2016). https://doi.org/10.1007/s10958-016-2690-8",
year = "2016",
doi = "10.1007/s10958-016-2690-8",
language = "English",
volume = "212",
pages = "577--583",
journal = "Journal of Mathematical Sciences",
issn = "1072-3374",
publisher = "Springer Nature",
number = "5",

}

RIS

TY - JOUR

T1 - Two-Chord Framings of Spanning Trees

AU - Maslova, Yu V.

AU - Nezhinskij, V. M.

N1 - Maslova, Y.V., Nezhinskij, V.M. Two-Chord Framings of Spanning Trees. J Math Sci 212, 577–583 (2016). https://doi.org/10.1007/s10958-016-2690-8

PY - 2016

Y1 - 2016

N2 - We find sufficient conditions under which a finite connected graph has a spanning tree with the following property. There is a numbering of edges and an injective mapping of the set of all edges of the tree to the set of all pairs of different chords (i.e., edges of the graph not contained in the tree) such that for any pair of chords in the image of the mapping, the cycles containing one chord from the pair and containing no other chords intersect along an edge in the preimage, and, maybe, along other edges of the tree with smaller numbers. The problem of study of graphs that possess this property appeared in the process of study the (isotopic) classification problem of embeddings of graphs in the 3-space. Bibliography: 3 titles.

AB - We find sufficient conditions under which a finite connected graph has a spanning tree with the following property. There is a numbering of edges and an injective mapping of the set of all edges of the tree to the set of all pairs of different chords (i.e., edges of the graph not contained in the tree) such that for any pair of chords in the image of the mapping, the cycles containing one chord from the pair and containing no other chords intersect along an edge in the preimage, and, maybe, along other edges of the tree with smaller numbers. The problem of study of graphs that possess this property appeared in the process of study the (isotopic) classification problem of embeddings of graphs in the 3-space. Bibliography: 3 titles.

KW - Span Tree

KW - Connected Graph

KW - Injective Mapping

KW - Ribbon Graph

KW - Elementary Cycle

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

U2 - 10.1007/s10958-016-2690-8

DO - 10.1007/s10958-016-2690-8

M3 - Article

AN - SCOPUS:84953307079

VL - 212

SP - 577

EP - 583

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 5

ER -

ID: 37047887