A theorem of Truemper (Q1586353)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1528647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A theorem of Truemper |
scientific article; zbMATH DE number 1528647 |
Statements
A theorem of Truemper (English)
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
0.7950429916381836
0 references
0.7474239468574524
0 references
0.7469251155853271
0 references
