期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (4)
A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [k] = {1, 2, ..., k}. Let p(u) denote the product......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (4)
Let gamma(G) and gamma(epsilon)(G) denote the domination number and exponential domination number of graph G, respectively. Henning et al., in [Heredi......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (4)
Given a positive integer n and an r-uniform hypergraph F, the Turan number ex(n, F) is the maximum number of edges in an F-free r-uniform hypergraph o......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (4)
Guo [Outpaths in semicomplete multipartite digraphs, Discrete Appl. Math. 95 (1999) 273-277] proposed the concept of the outpath in digraphs. An outpa......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (1)
Thomassen, [Edge-disjoint Hamiltonian paths and cycles in tournaments, J. Combin. Theory Ser. B 28 (1980) 142-163] proved that every strong tournament......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (1)
A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e is an element of E(G)}, there exists a proper edge-coloring phi of G such t......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (1)
In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing nu......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (1)
A graph G of order n is implicit claw-heavy if in every induced copy of K-1,K-3 in G there are two non-adjacent vertices with sum of their implicit de......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (1)
An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E -> {1, ..., vertical bar E vertical bar} ......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (1)
Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (2006) 17-21] raised the following two problems: (1) L......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (1)
A linear k-coloring of a graph is a proper k-coloring of the graph such that any subgraph induced by the vertices of any pair of color classes is a un......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (2)
Let k be an integer with k >= 2. A digraph is k-quasi-transitive, if for any path x(0)x(1)... x(k) of length k, x(0) and x(k) are adjacent. Let D b......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (2)
Let G be a 4-connected graph. We call an edge e of G removable if the following sequence of operations results in a 4-connected graph: delete e from G......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (2)
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1......
期刊： DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021; 41 (2)
A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertic......
