Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs

  title={Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs},
  author={Jinquan Xu and Ping Li and Zhengke Miao and Keke Wang and Hongyuan Lai},
  journal={International Journal of Computer Mathematics},
  pages={1662 - 1672}
  • Jinquan Xu, Ping Li, H. Lai
  • Published 1 August 2014
  • Mathematics
  • International Journal of Computer Mathematics
Motivated by the Chinese Postman Problem, Boesch, Suffel, and Tindell [The spanning subgraphs of Eulerian graphs, J. Graph Theory 1 (1977), pp. 79–84] proposed the supereulerian graph problem which seeks the characterization of graphs with a spanning Eulerian subgraph. Pulleyblank [A note on graphs spanned by Eulerian graphs, J. Graph Theory 3 (1979), pp. 309–310] showed that the supereulerian problem, even within planar graphs, is NP-complete. In this paper, we settle an open problem raised by… 

On the Independence Number of Traceable 2-Connected Claw-Free Graphs

It is shown that every 2-connected claw-free graph with independence number α(G) ≤ 6 is traceable or belongs to two exceptional families of well-defined graphs.

Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree

Every connected simple graph G with δ (G) ≥ α ′ ( G) has a hamiltonian line graph.

The Independence Number Conditions for 2-Factors of a Claw-Free Graph

In 2014, some scholars showed that every 2-connected claw-free graph G with independence number α(G)≤3 is Hamiltonian with one exception of family of graphs. If a nontrivial path contains only

On Supereulerian Digraphs

On Supereulerian Digraphs Mansour Jarbo Algefari A digraph D is eulerian if D is connected and for any v ∈ V (D), d+D(v) = d − D(v). A digraph D is supereulerian if D contains a spanning eulerian

Locally dense supereulerian digraphs

Chvátal–Erdös Type Conditions for Hamiltonicity of Claw-Free Graphs

The main result implies that improvements to case (a) or (b) by increasing the value of r and by enlarging the collection of exceptional graphs can be obtained with the help of a computer.

Supereulerian Digraphs with Large Arc‐Strong Connectivity

It is proved that if, then D has a spanning eulerian subdigraph, and let be the arc-strong connectivity of D, and be the size of a maximum matching of D.

A Condition on Hamilton-Connected Line Graphs



On a Closure Concept in Claw-Free Graphs

IfGis a claw-free graph, then there is a graphcl(G) such that (i)Gis a spanning subgraph ofcl(G), (ii)cl(G) is a line graph of a triangle-free graph, and (iii)the length of a longest cycle inGand

Supereulerian graphs: A survey

This paper outlines the research on supereulerian graphs, the reduction method, and its applications and describes the applications of the method.

The spanning subgraphs of eulerian graphs

It is shown that a connected graph G spans an eulerian graph if and only if G is not spanned by an odd complete bigraph K(2m + 1, 2n + 1). A disconnected graph spans an eulerian graph if and only if

A note on graphs spanned by Eulerian graphs

We show that the problem raised by Boesch, Suffel, and Tindell of determining whether or not a graph is spanned by an Eulerian subgraph is NP-complete. We also note that there does exist a good

A reduction method to find spanning Eulerian subgraphs

A general method to find a spanning eulerian subgraph of G such that the vertices of odd degree in Γ form a specified set S ⊆ V(G), such that G - E(Γ) is connected.

On Eulerian and Hamiltonian Graphs and Line Graphs

A graph G has a finite set V of points and a set X of lines each of which joins two distinct points (called its end-points), and no two lines join the same pair of points. A graph with one point and