Temat: Total graph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A note on total colorings of planar graphs without 4-cycles
Autorzy:: Wang, Ping
Wu, Jian-Liang
Powiązania:: https://bibliotekanauki.pl/articles/744436.pdf
Data publikacji:: 2004
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: total coloring
planar graph
list coloring
girth
Opis:: Let G be a 2-connected planar graph with maximum degree Δ such that G has no cycle of length from 4 to k, where k ≥ 4. Then the total chromatic number of G is Δ +1 if (Δ,k) ∈ {(7,4),(6,5),(5,7),(4,14)}.
Źródło:: Discussiones Mathematicae Graph Theory; 2004, 24, 1; 125-135
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: On List Equitable Total Colorings of the Generalized Theta Graph
Autorzy:: Mudrock, Jeffrey A.
Marsh, Max
Wagstrom, Tim
Powiązania:: https://bibliotekanauki.pl/articles/32326107.pdf
Data publikacji:: 2021-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph coloring
total coloring
equitable coloring
list coloring
equitable choosability
Opis:: In 2003, Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A k-assignment, L, for a graph G assigns a list, L(v), of k available colors to each v ∈ V (G), and an equitable L-coloring of G is a proper coloring, f, of G such that f(v) ∈ L(v) for each v ∈ V (G) and each color class of f has size at most ⌈|V (G)|/k⌉. Graph G is equitably k-choosable if G is equitably L-colorable whenever L is a k-assignment for G. In 2018, Kaul, Mudrock, and Pelsmajer subsequently introduced the List Equitable Total Coloring Conjecture which states that if T is a total graph of some simple graph, then T is equitably k-choosable for each k ≥ max{x_ℓ(T), Δ(T)/2 + 2} where Δ(T) is the maximum degree of a vertex in T and x_ℓ(T ) is the list chromatic number of T. In this paper, we verify the List Equitable Total Coloring Conjecture for subdivisions of stars and the generalized theta graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2021, 41, 4; 1215-1233
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Fractional ($ \mathcal{P} , \mathcal{Q} $)-Total List Colorings of Graphs
Autorzy:: Kemnitz, Arnfried
Mihók, Peter
Voigt, Margit
Powiązania:: https://bibliotekanauki.pl/articles/30146708.pdf
Data publikacji:: 2013-03-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph property
total coloring
(P,Q)-total coloring
fractional coloring
fractional (P,Q)-total chromatic number
circular coloring
circular (P,Q)-total chromatic number
list coloring
(P,Q)-total (a
b)-list colorings
Opis:: Let $ r, s \in \mathbb{N}$, $r \ge s$, and $ \mathcal{P} $ and $ \mathcal{Q} $ be two additive and hereditary graph properties. A $ (P,Q) $-total $(r, s)$-coloring of a graph $G = (V,E)$ is a coloring of the vertices and edges of $G$ by $s$-element subsets of $ \mathbb{Z}_r$ such that for each color $i$, $0 \le i \le r − 1$, the vertices colored by subsets containing $i$ induce a subgraph of $G$ with property $ \mathcal{P} $, the edges colored by subsets containing $i$ induce a subgraph of $G$ with property $ \mathcal{Q} $, and color sets of incident vertices and edges are disjoint. The fractional $ (\mathcal{P}, \mathcal{Q})$-total chromatic number $ \chi_{f,P,Q}^{''}(G)$ of $G$ is defined as the infimum of all ratios $r//s$ such that $G$ has a $ ( \mathcal{P}, \mathcal{Q})$-total $(r, s)$-coloring. A $ ( \mathcal{P}, \mathcal{Q} $-total independent set $ T = V_T \cup E_T \subseteq V \cup E$ is the union of a set $V_T$ of vertices and a set $E_T$ of edges of $G$ such that for the graphs induced by the sets $V_T$ and $E_T$ it holds that $ G[ V_T ] \in \mathcal{ P } $, $ G[ E_T ] \in \mathcal{Q} $, and $ G[ V_T ] $ and $ G[ E_T ] $ are disjoint. Let $ T_{ \mathcal{P} , \mathcal{Q} } $ be the set of all $ (\mathcal{P} ,\mathcal{Q})$-total independent sets of $G$. Let $L(x)$ be a set of admissible colors for every element $ x \in V \cup E $. The graph $G$ is called $ (\mathcal{P} , \mathcal{Q}) $-total $(a, b)$-list colorable if for each list assignment $L$ with $|L(x)| = a$ for all $x \in V \cup E$ it is possible to choose a subset $ C(x) \subseteq L(x)$ with $|C(x)| = b$ for all $ x \in V \cup E$ such that the set $ T_i $ which is defined by $ T_i = {x \in V \cup E : i \in C(x) } $ belongs to $ T_{ \mathcal{P},\mathcal{Q}}$ for every color $i$. The $ (\mathcal{P}, \mathcal{Q})$- choice ratio $ \text{chr}_{\mathcal{P},\mathcal{Q}}(G)$ of $G$ is defined as the infimum of all ratios $a//b$ such that $G$ is $ (\mathcal{P},\mathcal{Q})$-total $(a, b)$-list colorable. We give a direct proof of $ \chi_{ f,\mathcal{P},\mathcal{Q} }^{ \prime \prime } (G) = \text{chr}_{ \mathcal{P} ,\mathcal{Q} }(G)$ for all simple graphs $G$ and we present for some properties $ \mathcal{P} $ and $ \mathcal{Q} $ new bounds for the $ (\mathcal{P}, \mathcal{Q})$-total chromatic number and for the $(\mathcal{P},\mathcal{Q})$-choice ratio of a graph $G$.
Źródło:: Discussiones Mathematicae Graph Theory; 2013, 33, 1; 167-179
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Total graph" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język