Nowhere-zero -flows of supergraphs.
Mohar, Bojan, Škrekovski, Riste (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Nowhere-zero 3-flows in squares of graphs.”
Nowhere-zero -flows of supergraphs.
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).
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...
The Turàn number of the graph 3P4
Halina Bielak, Sebastian Kieliszek (2014)
Annales UMCS, Mathematica
Similarity:
Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)
Another characterisation of planar graphs.
Little, C.H.C., Sanjith, G. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Decompositions of graphs into 5-cycles and other small graphs.
Sousa, Teresa (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Intersection Graphs of Graphs
Bohdan Zelinka (1975)
Matematický časopis
Similarity: