Wyniki wyszukiwania dla: CIRCULAR CHROMATIC NUMBER - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: CIRCULAR CHROMATIC NUMBER
Przykład wyników znalezionych w innych katalogach

Wyniki wyszukiwania dla: CIRCULAR CHROMATIC NUMBER

  • T-colorings, divisibility and circular chromatic number

    Let T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...

    Pełny tekst do pobrania w portalu

  • The circular chromatic index of some class 2 graphs

    Publikacja

    W artykule został wyznaczony cyrkularny indeks chromatyczny dla dwóch rodzin grafów klasy 2. Co więcej, podano nie trywialne oszacowania tego parametru dla snarków Isaacsa i Goldberga. Na koniec artykułu rozważana jest złożoność obliczeniowa problemów związanych z cyrkularnym kolorowaniem krawędzi.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Total chromatic sum for trees

    Publikacja

    - Rok 2021

    The total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Infinite chromatic games

    In the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...

    Pełny tekst do pobrania w portalu

  • A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs

    We consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...

  • 2-Coloring number revisited

    2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...

    Pełny tekst do pobrania w portalu

  • Relations between the domination parameters and the chromatic index of a graph

    In this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.

    Pełny tekst do pobrania w portalu

  • Process Engineering in Circular Economy

    Kursy Online
    • J. Mąkinia

    Kurs jest przeznaczony dla doktorantów szkoły doktorskiej w dyscyplnach: inżynieria lądowa i transport (SzD), III stopnia, stacjonarne inżynieria środowiska, górnictwo i energetyka (SzD), III stopnia, stacjonarne   The course is addressed to PhD students of the doctoral school in disciplines: civil engineering and transport environmental engineering, mining and power engineering Course type: lecture Total hours of...

  • Process engineering in circular economy

    Kursy Online
    • J. Mąkinia

    Definition and principles of the circular economy (CE). The transition from a linear model to a circular model. Business models for the CE. Circular design and innovation. CE assessment carbon footprint, life cycle assessment. Case studies of the cities implementing the CE concept. CE policy and legislation (EU and Poland). Wastewater treatment plants as an element of the CE. Energy and nutrient recovery technologies in wastewater...

  • Process engineering in circular economy 22/23

    Kursy Online
    • J. Mąkinia

    Background of the circular economy What is the circular economy? (Definition) How is the circular economy different from a linear economy? How do materials circulate in the circular economy? The circular economy and sustainable development How to measure circularity? Link between the circular economy and life cycle assessment (LCA) What are the benefits of the circular economy? The circular economy policies and governance Wastewater...