The Normal Graph Conjecture for Two Classes of Sparse Graphs
نویسندگان
چکیده
منابع مشابه
Hadwiger’s conjecture on special classes of graphs
The Hadwiger number of a graph G is the largest integer n for which the complete graph on n vertices is a minor of G. Hadwiger conjectured that for any graph G, ,where is the chromatic number of G. We will address Hadwiger’s conjecture for circular arc graphs and their subfamilies. Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices ar...
متن کاملOn Ultralimits of Sparse Graph Classes
The notion of nowhere denseness is one of the central concepts of the recently developed theory of sparse graphs. We study the properties of nowhere dense graph classes by investigating appropriate limit objects defined using the ultraproduct construction. Our goal is to demonstrate that different equivalent definitions of nowhere denseness, for example via quasi-wideness or the splitter game, ...
متن کاملThe Degree-Diameter Problem for Sparse Graph Classes
The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree ∆ and diameter k. For fixed k, the answer is Θ(∆k). We consider the degree-diameter problem for particular classes of sparse graphs, and establish the following results. For graphs of bounded average degree the answer is Θ(∆k−1), and for graphs of bounded arboricity the answer is Θ(∆bk/2c), in bot...
متن کاملAnti-Path Cover on Sparse Graph Classes
Graph Hamiltonian properties are studied especially in connection with graph connectivity properties. A graph is called Hamiltonian if there is a path passing through all its vertices in that graph. In this work we are interested in sparse graph setting for which this question was already solved e.g. using the famous theorem of Courcelle [4]. It is possible to express the Hamiltonian property b...
متن کاملThe flower conjecture in special classes of graphs
We say that a spanning eulerian subgraph F ⊂ G is a flower in a graph G if there is a vertex u ∈ V (G) (called the center of F ) such that all vertices of G except u are of the degree exactly 2 in F. A graph G has the flower property if every vertex of G is a center of a flower. Kaneko conjectured that G has the flower property if and only if G is hamiltonian. In the present paper we prove this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2017
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-017-1868-2