On (s,t)-supereulerian triangle free graphs

2009 WRI World Congress on Software Engineering, WCSE 2009

Volumn 2, Issue , 2009, Pages 398-401

  Li, Xiaomin ^a   Li, Shengyu ^a  

^a CHONGQING TECHNOLOGY AND BUSINESS UNIVERSITY   (China)

Author keywords

(s, t) supereulerian; Collapsible graph; Reduction; Triangle free

Indexed keywords

COLLAPSIBLE GRAPHS; DISJOINT EDGES; SPANNING EULERIAN SUBGRAPH; TRIANGLE-FREE; TRIANGLE-FREE GRAPHS;

COMPUTER SOFTWARE;

GRAPH THEORY;

EID: 72849136582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCSE.2009.49     Document Type: Conference Paper

References (6)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier, Amsterdan, 1976.
2. P. A. Catlin, A reduction method to find spanning eu-lerian subgraphs, J. Graph Theory 12 (1988) 29-45.
3. P. A. Catlin, Supereulerian graph, Collopsible graphs and 4-cycles, Congressus Numerantium 56 (1987) 223-246.
4. P. A. Catlin, Z. Han, H.-J. Lai, Graphs without spanned closed trails, Discrete Math. 160 (1996) 81-91.
5. Z. H. Chen, H.-J. Lai, Supereulerian graphs and the Petersen graph, Ars Combinatoria 48 (1998) 271-282.
6. H.-J. Lai, Contractions and Hamiltonian line graphs, J. Graph Theory 12 (1988) 11-15.