A survey of the studies on Gallai and anti-Gallai graphs

نویسندگان

چکیده مقاله:

The Gallai graph and the anti-Gallai graph of a graph G are edge disjoint spanning subgraphs of the line graph L(G). The vertices in the Gallai graph are adjacent if two of the end vertices of the corresponding edges in G coincide and the other two end vertices are nonadjacent in G. The anti-Gallai graph of G is the complement of its Gallai graph in L(G). Attributed to Gallai (1967), the study of these graphs got prominence with the work of Sun (1991) and Le (1996). This is a survey of the studies conducted so far on Gallai and anti-Gallai of graphs and their associated properties.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gallai and anti-Gallai graphs

This chapter deals with two graph classes the Gallai graphs and the anti-Gallai graphs. \Ve construct infinitely many pairs of graphs G and H such that f( G) = r( H). The existence of a finite family offorbidden subgraphs for the Gallai graphs and the ant.i-Gallai graphs to be H-frce, for any fillit.e graph H is proved and the forbidden subgraph characterizations of G for which the Gallai graph...

متن کامل

Gallai graphs and anti-Gallai graphs

The Gallai graph and the anti-Gallai graph of a graph G have the edges of G as their vertices. Two edges of G are adjacent in the Gallai graph of G if they are incident but do not span a triangle in G; they are adjacent in the anti-Gallai graph of G if they span a triangle in G. In this paper we show: The Four Color Theorem can be equivalently stated in terms of anti-Gallai graphs; the problems...

متن کامل

Gallai and Anti-gallai Graphs of a Graph

The paper deals with graph operators—the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs and the anti-Gallai graphs to be H-free for any finite graph H. The case of complement reducible graphs—cographs is discussed in detail. Some relations between the chromatic number, the radius and the diameter of a graph and it...

متن کامل

Lattice graphs with Gallai ’ s property

We investigate graphs with the property that all longest paths or all longest cycles have empty intersection. In this paper, we find such graphs as subgraphs of cubic lattices.

متن کامل

Gallai colorings of non-complete graphs

Gallai-colorings of complete graphs – edge colorings such that no triangle is colored with three distinct colors – occur in various contexts such as the theory of partially ordered sets (in Gallai’s original paper), information theory and the theory of perfect graphs. We extend here Gallai-colorings to non-complete graphs and study the analogue of a basic result – any Gallai-colored complete gr...

متن کامل

A decomposition of Gallai multigraphs

An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi) graph is a simple, complete, edge-colored (multi) graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decompos...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 6  شماره 1

صفحات  93- 112

تاریخ انتشار 2021-06-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023