Nowhere-zero 3-flows in squares of graphs.
Xu, Rui, Zhang, Cun-Quan (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Nowhere-zero -flows of supergraphs.”
Nowhere-zero 3-flows in squares of graphs.
Flows on the join of two graphs
Robert Lukoťka, Edita Rollová (2013)
Mathematica Bohemica
Similarity:
The join of two graphs and is a graph formed from disjoint copies of and by connecting each vertex of to each vertex of . We determine the flow number of the resulting graph. More precisely, we prove that the join of two graphs admits a nowhere-zero -flow except for a few classes of graphs: a single vertex joined with a graph containing an isolated vertex or an odd circuit tree component, a single edge joined with a graph containing only isolated edges, a single edge plus...
On the minimal length of the longest trail in a fixed edge-density graph
Vajk Szécsi (2013)
Open Mathematics
Similarity:
A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).
List edge-colorings of series-parallel graphs.
Juvan, Martin, Mohar, Bojan, Thomas, Robin (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Acyclic chromatic index of a subdivided graph
Jozef Fiamčík (1984)
Archivum Mathematicum
Similarity:
The graph polynomial and the number of proper vertex coloring
Michael Tarsi (1999)
Annales de l'institut Fourier
Similarity:
Alon and Tarsi presented in a previous paper a certain weighted sum over the set of all proper -colorings of a graph, which can be computed from its graph polynomial. The subject of this paper is another combinatorial interpretation of the same quantity, expressed in terms of the numbers of certain modulo flows in the graph. Some relations between graph parameters can be obtained by combining these two formulas. For example: The number of proper 3-colorings of a 4-regular graph and...
A note on the edge-connectivity of cages.
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Deficiency of forests
Sana Javed, Mujtaba Hussain, Ayesha Riasat, Salma Kanwal, Mariam Imtiaz, M. O. Ahmad (2017)
Open Mathematics
Similarity:
An edge-magic total labeling of an (n,m)-graph G = (V,E) is a one to one map λ from V(G) ∪ E(G) onto the integers {1,2,…,n + m} with the property that there exists an integer constant c such that λ(x) + λ(y) + λ(xy) = c for any xy ∈ E(G). It is called super edge-magic total labeling if λ (V(G)) = {1,2,…,n}. Furthermore, if G has no super edge-magic total labeling, then the minimum number of vertices added to G to have a super edge-magic total labeling, called super edge-magic deficiency...
M 2 -Edge Colorings Of Cacti And Graph Joins
Július Czap, Peter Šugerek, Jaroslav Ivančo (2016)
Discussiones Mathematicae Graph Theory
Similarity:
An edge coloring φ of a graph G is called an M2-edge coloring if |φ(v)| ≤ 2 for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let 𝒦2(G) denote the maximum number of colors used in an M2-edge coloring of G. In this paper we determine 𝒦2(G) for trees, cacti, complete multipartite graphs and graph joins.