A theorem of Truemper (Q1586353)

From MaRDI portal
Revision as of 14:14, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A theorem of Truemper
scientific article

    Statements

    A theorem of Truemper (English)
    0 references
    0 references
    0 references
    0 references
    13 November 2000
    0 references
    A new proof is given of a theorem characterizing graphs whose edges can be labeled so that all chordless cycles have prescribed partities. Various consequences of the theorem are derived that relate to chordless cycles, triangulated graphs, and balanced matrices.
    0 references
    edge labeling
    0 references
    balance
    0 references
    signed graphs
    0 references
    3-path configurations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references