A theorem of Truemper (Q1586353): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004930070028 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4255333936 / rank | |||
Normal rank | |||
Latest revision as of 20:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A theorem of Truemper |
scientific article |
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
