{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T18:30:07Z","timestamp":1771353007379,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A graph is 2-cycled if each edge is contained in exactly two of its chordless cycles. The 2-cycled graphs arise in connection with the study of balanced signing of graphs and matrices. The concept of balance of a $\\{0,+1,-1\\}$-matrix or a signed bipartite graph has been studied by Truemper and by Conforti et al. The concept of $\\alpha$-balance is a generalization introduced by Truemper. Truemper exhibits a family ${\\cal F}$ of planar graphs such that a graph $G$ can be signed to be  $\\alpha$-balanced if and only if each induced subgraph of $G$ in ${\\cal F}$ can. We show here that the graphs in ${\\cal F}$ are exactly the 2-connected 2-cycled graphs.<\/jats:p>","DOI":"10.37236\/1238","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T20:26:40Z","timestamp":1578688000000},"source":"Crossref","is-referenced-by-count":2,"title":["For Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles?"],"prefix":"10.37236","volume":"3","author":[{"given":"Uri N.","family":"Peled","sequence":"first","affiliation":[]},{"given":"Julin","family":"Wu","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[1996,4,15]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v3i1r14\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v3i1r14\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T01:17:33Z","timestamp":1579310253000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v3i1r14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4,15]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[1996,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1238","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,4,15]]},"article-number":"R14"}}