Spanning Eulerian Subgraphs in claw-free graphs

Zhi-Hong Chen; Hong-Jian Lai; Weiqi Luo; Yehomg Shao

Spanning Eulerian Subgraphs in claw-free graphs

Zhi-Hong Chen, Hong-Jian Lai, Weiqi Luo, Yehomg Shao

Research output: Contribution to journal › Article › peer-review

Abstract

A graph is claw-free if it has no induced K 1,3, subgraph. A graph is essential 4-edge-connected if removing at most three edges, the resulting graph has at most one component having edges. In this note, we show that every essential 4-edge-connected claw free graph has a spanning Eulerian subgraph with maximum degree at most 4.

Original language	American English
Journal	Scholarship and Professional Work - LAS
Volume	59
State	Published - Jan 1 2006

Keywords

claw-free graph
spanning Eulerian subgraph

Disciplines

Computer Sciences
Mathematics

Access to Document

Spanning Eulerian Subgraphs in claw-free graphsFinal published version, 705 KBLicense: Unspecified

Cite this

@article{d46f9194ea2947348554fd8d4d435e46,

title = "Spanning Eulerian Subgraphs in claw-free graphs",

abstract = " A graph is claw-free if it has no induced K 1,3, subgraph. A graph is essential 4-edge-connected if removing at most three edges, the resulting graph has at most one component having edges. In this note, we show that every essential 4-edge-connected claw free graph has a spanning Eulerian subgraph with maximum degree at most 4.",

keywords = "claw-free graph, spanning Eulerian subgraph",

author = "Zhi-Hong Chen and Hong-Jian Lai and Weiqi Luo and Yehomg Shao",

year = "2006",

month = jan,

day = "1",

language = "American English",

volume = "59",

journal = "Scholarship and Professional Work - LAS",

}

TY - JOUR

T1 - Spanning Eulerian Subgraphs in claw-free graphs

AU - Chen, Zhi-Hong

AU - Lai, Hong-Jian

AU - Luo, Weiqi

AU - Shao, Yehomg

PY - 2006/1/1

Y1 - 2006/1/1

N2 - A graph is claw-free if it has no induced K 1,3, subgraph. A graph is essential 4-edge-connected if removing at most three edges, the resulting graph has at most one component having edges. In this note, we show that every essential 4-edge-connected claw free graph has a spanning Eulerian subgraph with maximum degree at most 4.

AB - A graph is claw-free if it has no induced K 1,3, subgraph. A graph is essential 4-edge-connected if removing at most three edges, the resulting graph has at most one component having edges. In this note, we show that every essential 4-edge-connected claw free graph has a spanning Eulerian subgraph with maximum degree at most 4.

KW - claw-free graph

KW - spanning Eulerian subgraph

UR - https://digitalcommons.butler.edu/facsch_papers/144

M3 - Article

VL - 59

JO - Scholarship and Professional Work - LAS

JF - Scholarship and Professional Work - LAS

ER -

Spanning Eulerian Subgraphs in claw-free graphs

Abstract

Keywords

Disciplines

Access to Document

Other files and links

Cite this