منابع مشابه
Token Sliding on Chordal Graphs
Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I . We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G. Given two independent sets I and J , the TOKEN SLIDING problem consists in deciding whether there exists a sequence of independent sets which transforms I into J so that eve...
متن کاملGraph Searching on Chordal Graphs
In the graph searching problem initially a graph with all edges contaminated is pre sented We would like to obtain a state of the graph in which all edges are simultaneously clear by a sequence of moves using searchers The objective is to achieve the desired state by using the least number of searchers Two variations of the graph searching problem are considered in this paper One is the edge se...
متن کاملPrecoloring extension on chordal graphs
In the precoloring extension problem (PrExt) we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. 1-PrExt is the special case where every color is assigned to at most one vertex in the precoloring. Answering an open question of Hujter and Tuza [HT96], we show that the 1-PrExt...
متن کاملOn b-perfect chordal graphs
The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the bchromatic number is equal to the chromatic number for every induced subgraph.
متن کاملChordal Graphs
One can prove the following propositions: (1) For every non zero natural number n holds n − 1 is a natural number and 1 ≤ n. (2) For every odd natural number n holds n − 1 is a natural number and 1 ≤ n. (3) For all odd integers n, m such that n < m holds n ≤ m − 2. (4) For all odd integers n, m such that m < n holds m + 2 ≤ n. (5) For every odd natural number n such that 1 6= n there exists an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2019
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0s01/0091