3,158 research outputs found
On some intriguing problems in Hamiltonian graph theory -- A survey
We survey results and open problems in Hamiltonian graph theory centred around three themes: regular graphs, -tough graphs, and claw-free graphs
A general framework for coloring problems: old results, new results, and open problems
In this survey paper we present a general framework for coloring problems that was introduced in a joint paper which the author presented at WG2003. We show how a number of different types of coloring problems, most of which have been motivated from frequency assignment, fit into this framework. We give a survey of the existing results, mainly based on and strongly biased by joint work of the author with several different groups of coauthors, include some new results, and discuss several open problems for each of the variants
A note on K4-closures in Hamiltonian graph theory
Let G=(V, E) be a 2-connected graph. We call two vertices u and v of G a K4-pair if u and v are the vertices of degree two of an induced subgraph of G which is isomorphic to K4 minus an edge. Let x and y be the common neighbors of a K4-pair u, v in an induced K4−e. We prove the following result: If N(x)N(y)N(u)N(v){u,v}, then G is hamiltonian if and only if G+uv is h amiltonian. As a consequence, a claw-free graph G is hamiltonian if and only if G+uv is hamiltonian, where u,v is a K4-pair. Based on these results we define socalled K4-closures of G. We give infinite classes of graphs with small maximum degree and large diameter, and with many vertices of degree two having complete K4-closures
A closure concept based on neighborhood unions of independent triples
The well-known closure concept of Bondy and Chvatal is based on degree-sums of pairs of nonadjacent (independent) vertices. We show that a more general concept due to Ainouche and Christofides can be restated in terms of degree-sums of independent triples. We introduce a closure concept which is based on neighborhood unions of independent triples and which also generalizes the closure concept of Bondy and Chvatal
On minimum degree conditions for supereulerian graphs
A graph is called supereulerian if it has a spanning closed trail. Let be a 2-edge-connected graph of order such that each minimal edge cut with satisfies the property that each component of has order at least . We prove that either is supereulerian or belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree : If is a 2-edge-connected graph of order with such that for every edge , we have , then either is supereulerian or belongs to one of two classes of exceptional graphs. We show that the condition cannot be relaxed
Isomorphisms and traversability of directed path graphs
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph \forw P_k(D) of a digraph is obtained by representing the directed paths on vertices of by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in form a directed path on vertices or form a directed cycle on vertices in . In this introductory paper several properties of \forw P_3(D) are studied, in particular with respect to isomorphism and traversability. In our main results, we characterize all digraphs with \forw P_3(D)\cong D, we show that \forw P_3(D_1)\cong\forw P_3(D_2) ``almost always'' implies , and we characterize all digraphs with Eulerian or Hamiltonian \forw P_3-graphs
- …