Zobrazeno 1 - 10
of 165
pro vyhledávání: '"Basavaraju, Manu"'
Publikováno v:
Discrete Mathematics, 347(4), (2024), 113898
An acyclic edge coloring of a graph is a proper edge coloring without any bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $a'(G)$, is the minimum $k$ such that $G$ has an acyclic edge coloring with $k$ colors. Fiam\v{c}\'{\i
Externí odkaz:
http://arxiv.org/abs/2305.01948
Publikováno v:
Water Science and Engineering, Vol 17, Iss 2, Pp 157-165 (2024)
Bio-jarosite, an iron mineral synthesized biologically using bacteria, is a substitute for iron catalysts in the Fenton oxidation of organic pollutants. Iron nanocatalysts have been widely used as Fenton catalysts because they have a larger surface a
Externí odkaz:
https://doaj.org/article/c37d17b465a94024a86182c72f0d7ca0
Publikováno v:
Discrete Mathematics, 346(8), (2023), 113434
An acyclic edge coloring of a graph is a proper edge coloring in which there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $a'(G)$, is the minimum positive integer $k$ such that $G$ has an acyclic edge coloring with
Externí odkaz:
http://arxiv.org/abs/2302.01638
Autor:
Anto, Nevil, Basavaraju, Manu
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:1, Graph Theory (May 30, 2023) dmtcs:10313
Gallai's path decomposition conjecture states that if $G$ is a connected graph on $n$ vertices, then the edges of $G$ can be decomposed into at most $\lceil \frac{n }{2} \rceil$ paths. A graph is said to be an odd semi-clique if it can be obtained fr
Externí odkaz:
http://arxiv.org/abs/2211.07159
Publikováno v:
Journal of Air Pollution and Health, Vol 9, Iss 2 (2024)
Introduction: This study investigated Polycyclic Aromatic Hydrocarbon (PAH) emissions from road traffic at the Surathkal toll plaza, in Karnataka, India. It focuses on two phases: when the toll station operated (Phase 1: January 2020 – March 2020)
Externí odkaz:
https://doaj.org/article/03a4caae880d43d2badcdcf14cef24cd
Publikováno v:
In Discrete Applied Mathematics 31 December 2024 359:407-418
Given a finite family $\mathcal{F}$ of graphs, we say that a graph $G$ is "$\mathcal{F}$-free" if $G$ does not contain any graph in $\mathcal{F}$ as a subgraph. A vertex-colored graph $H$ is called "rainbow" if no two vertices of $H$ have the same co
Externí odkaz:
http://arxiv.org/abs/2111.13115
Hadwiger's conjecture is one of the most important and long-standing conjectures in graph theory. Reed and Seymour showed in 2004 that Hadwiger's conjecture is true for line graphs. We investigate this conjecture on the closely related class of total
Externí odkaz:
http://arxiv.org/abs/2107.09994
Publikováno v:
In Discrete Mathematics April 2024 347(4)
A linear forest is an acyclic graph whose each connected component is a path; or in other words, it is an acyclic graph whose maximum degree is at most 2. A linear coloring of a graph $G$ is an edge coloring of $G$ such that the edges in each color c
Externí odkaz:
http://arxiv.org/abs/2007.06066