Ear decompositions in combed graphs.
Ecken mit starken Zusammenhangseigenschaften in endlichen Graphen.
Edge and total choosability of near-outerplanar graphs.
Edge and vertex operations on upper embeddable graphs
Edge Bases of Complete Uniform Hypergraphs
Edge colorings and total colorings of integer distance graphs
An integer distance graph is a graph G(D) with the set Z of integers as vertex set and two vertices u,v ∈ Z are adjacent if and only if |u-v| ∈ D where the distance set D is a subset of the positive integers N. In this note we determine the chromatic index, the choice index, the total chromatic number and the total choice number of all integer distance graphs, and the choice number of special integer distance graphs.
Edge cover time for regular graphs.
Edge cycle extendable graphs
A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a larger cycle C⁺ is also formed from edges and one chord of a cycle C' of length one greater than C with V(C') ⊆ V(C⁺). Edge cycle extendable graphs are characterized by every block being either chordal (every nontriangular cycle has a chord) or chordless (no nontriangular cycle has a chord); equivalently, every chord of a cycle of length five or more has a noncrossing chord.
Edge Dominating Sets and Vertex Covers
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering, edge domination, and matching parameters is explored. In addition, the total vertex cover number is compared to the total domination number of trees and grid graphs.
Edge domination in graphs of cubes
The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number. Some upper bounds for them are found in the case of the -dimensional cube .
Edge maximal -edge disjoint free graphs
For two positive integers r and s, 𝓖(n;r,s) denotes to the class of graphs on n vertices containing no r of s-edge disjoint cycles and f(n;r,s) = max{𝓔(G):G ∈ 𝓖(n;r,s)}. In this paper, for integers r ≥ 2 and k ≥ 1, we determine f(n;r,2k+1) and characterize the edge maximal members in 𝓖(n;r,2k+1).
Edge neighborhoods in line graphs.
Edge neighbourhood graphs
Edge rotations and distance between graphs
Edge shift distance between trees
Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is investigated in the case of trees and compared with other distances.
Edge-bandwidth of the triangular grid.
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if Δ(G) ≥ 9, then χ'ₗ(G) = Δ(G) and χ''ₗ(G) = Δ(G)+1. We also show that if Δ(G) ≥ 6, then χ'ₗ(G) ≤ Δ(G)+1 and if Δ(G) ≥ 7, then χ''ₗ(G) ≤ Δ(G)+2. All of these results extend to graphs in the projective plane and when Δ(G) ≥ 7 the results also extend to graphs in the torus and Klein bottle. This second edge-choosability result improves on work of Wang and Lih and of Zhang and Wu. All of our results use the discharging method...
Edge-coloring and -coloring for various classes of graphs.
Edge-colouring of graphs and hereditary graph properties
Edge-colourings of graphs have been studied for decades. We study edge-colourings with respect to hereditary graph properties. For a graph , a hereditary graph property and we define to be the minimum number of colours needed to properly colour the edges of , such that any subgraph of induced by edges coloured by (at most) colours is in . We present a necessary and sufficient condition for the existence of . We focus on edge-colourings of graphs with respect to the hereditary properties...
Edge-Colourings of Permutation Graphs