A theorem of Truemper

DOI10.1007/s004930070028zbMath0949.05071OpenAlexW4255333936MaRDI QIDQ1586353

Bert Gerards, Michele Conforti, Ajai Kapoor

Publication date: 13 November 2000

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930070028

zbMATH Keywords

signed graphsbalanceedge labeling3-path configurations

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75) Signed and weighted graphs (05C22)

Related Items (9)

Hereditary Efficiently Dominatable Graphs ⋮ Graphs of separability at most 2 ⋮ Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs ⋮ Balanced matrices ⋮ On the forbidden induced subgraph sandwich problem ⋮ Square-free perfect graphs. ⋮ Graphs of Separability at Most Two: Structural Characterizations and Their Consequences ⋮ Even-hole-free graphs part I: Decomposition theorem ⋮ Recognizing balanceable matrices

This page was built for publication: A theorem of Truemper