For which graphs does every edge belong to exactly two chordless cycles?

Peled, Uri N.; Wu, Julin

The Electronic Journal of Combinatorics [electronic only] (1996)

  • Volume: 3, Issue: 1
  • ISSN: 1077-8926

How to cite

top

Peled, Uri N., and Wu, Julin. "For which graphs does every edge belong to exactly two chordless cycles?." The Electronic Journal of Combinatorics [electronic only] 3.1 (1996): . <http://eudml.org/doc/118909>.

@article{Peled1996,
author = {Peled, Uri N., Wu, Julin},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {chordless cycles; 2-cycled graphs; matrices; balance},
language = {eng},
number = {1},
pages = {},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {For which graphs does every edge belong to exactly two chordless cycles?},
url = {http://eudml.org/doc/118909},
volume = {3},
year = {1996},
}

TY - JOUR
AU - Peled, Uri N.
AU - Wu, Julin
TI - For which graphs does every edge belong to exactly two chordless cycles?
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1996
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 3
IS - 1
SP -
LA - eng
KW - chordless cycles; 2-cycled graphs; matrices; balance
UR - http://eudml.org/doc/118909
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.