A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs (Q1088683): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Isomorphisms of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-skein isomorphisms of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(n\)-skein isomorphisms of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concept of a vertex in a matroid and 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge semi-isomorphisms and semi-dualities of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthening of the Kuratowski planarity criterion for 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit preserving edge maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Whitney's 2‐isomorphism theorem for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial matroid representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90236-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021768304 / rank
 
Normal rank

Latest revision as of 08:41, 30 July 2024

scientific article
Language Label Description Also known as
English
A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
scientific article

    Statements

    A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs (English)
    0 references
    1987
    0 references
    Verf. gibt einen neuen Beweis für den 2-Isomorphie-Satz von \textit{H. Whitney} [2-isomorphic graphs, Am. J. Math. 55, 245-254 (1933; Zbl 0006.37005)]. Grundlegend dabei ist der Begriff der Wegzerlegung, der vom Verf. [Graph expansions and reduction, Algebraic Methods in Graph Theory, Vol. I, Conf. Szeged 1978, Colloq. Math. Soc. János Bolyai 25, 317-342 (1981; Zbl 0475.05079)] eingeführt und studiert wurde. Im Anschluß an den Beweis werden Kriterien dafür gegeben, wann eine Kantenbijektion zwischen Graphen durch einen 2-Isomorphismus induziert wird. Diese Kriterien werden dann in den allgemeineren Zusammenhang von Teilgraphenisomorphismen und Teilgrapheninjektionen gestellt; Verf. berichtet über Kriterien, die erzwingen, daß solche Abbildungen durch Isomorphismen induziert werden.
    0 references
    2 isomorphism theorem
    0 references
    path partition
    0 references
    induced edge bijection
    0 references
    0 references

    Identifiers