Conforti, Michele; Gerards, Bert; Kapoor, Ajai A theorem of Truemper. (English) Zbl 0949.05071 Combinatorica 20, No. 1, 15-26 (2000). 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. Reviewer: Ove Frank (Stockholm) Cited in 9 Documents MSC: 05C75 Structural characterization of families of graphs 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.) 05B35 Combinatorial aspects of matroids and geometric lattices 05C22 Signed and weighted graphs Keywords:edge labeling; balance; signed graphs; 3-path configurations PDFBibTeX XMLCite \textit{M. Conforti} et al., Combinatorica 20, No. 1, 15--26 (2000; Zbl 0949.05071) Full Text: DOI