Results 71 to 80 of about 1,939,159 (235)
Grid Representations and the Chromatic Number [PDF]
A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must intersect.
Balko, Martin
core +1 more source
Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge ...
P. Deepa +2 more
doaj +1 more source
GENERAL APPROACH TO LINE GRAPHS OF GRAPHS
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marczyk, Antoni, Skupień, Zdzisław
openaire +1 more source
Recognizing and Drawing IC-planar Graphs
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs.
C Auer +27 more
core +1 more source
Efficient Generation of Geographically Accurate Transit Maps
We present LOOM (Line-Ordering Optimized Maps), a fully automatic generator of geographically accurate transit maps. The input to LOOM is data about the lines of a given transit network, namely for each line, the sequence of stations it serves and the ...
Argyriou Evmorfia +3 more
core +1 more source
Split Legendary Domination in graphs
Harary and Norman introduced the line graph L(G) . We introduced the legendary domination number by combining the domination concept both in graph and its line graph.
P. Kavitha
doaj +1 more source
Oriented gain graphs, line graphs and eigenvalues [PDF]
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of gain graphs with complex units, matrix properties are established.
openaire +3 more sources
On the application of line graphs in quantitative structure-property studies [PDF]
Let G be a molecular graph possessing m0(G) edges. Let m1(G) be the number of edges of the line graph L(G) of G, known as the Bertz index. Let m2(G) be the number of edges of the line graph of L(G), etc.
Gutman Ivan, Tomović Željko
doaj +1 more source
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree [PDF]
Tara Abrishami +6 more
openalex +1 more source

