Results 21 to 30 of about 1,361,736 (138)
On hamiltonian line-graphs [PDF]
Transactions of the American Mathematical Society, 1968 Introduction. The line-graph L(G) of a nonempty graph G is the graph whose point set can be put in one-to-one correspondence with the line set of G in such a way that two points of L(G) are adjacent if and only if the corresponding lines of G are adjacent.
openaire +1 more source
Bar 1-Visibility Drawings of 1-Planar Graphs
, 2013 A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean +13 more
core +1 more source
Towards on-line Ohba's conjecture [PDF]
, 2012 The on-line choice number of a graph is a variation of the choice number defined through a two person game. It is at least as large as the choice number for all graphs and is strictly larger for some graphs. In particular, there are graphs $G$ with $|V(G)
Kozik, Jakub, Micek, Piotr, Zhu, Xuding
core
Color-line and proper color-line graphs
Discrete Applied Mathematics, 2020 Motivated by investigations of rainbow matchings in edge colored graphs, we introduce the notion of color-line graphs that generalizes the classical concept of line graphs in a natural way. Let $H$ be a (properly) edge-colored graph. The (proper) color-line graph $C\!L(H)$ of $H$ has edges of $H$ as vertices, and two edges of $H$ are adjacent in $C\!L ...
Le, Van Bang, Pfender, Florian
openaire +4 more sources
Straight-line Drawability of a Planar Graph Plus an Edge
, 2015 We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing.
C Gutwenger +8 more
core +1 more source
GENERAL APPROACH TO LINE GRAPHS OF GRAPHS
Demonstratio Mathematica, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marczyk, Antoni, Skupień, Zdzisław
openaire +1 more source
On edge-group choosability of graphs [PDF]
, 2011 In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given.
Khamseh, Amir, Omidi, Gholamreza
core
Graded Betti numbers of path ideals of cycles and lines [PDF]
, 2016 We use purely combinatorial arguments to give a formula to compute all graded Betti numbers of path ideals of line graphs and cycles. As a consequence we can give new and short proofs for the known formulas of regularity and projective dimensions of path
Alilooee, Ali, Faridi, Sara
core
On the Representability of Line Graphs
, 2011 A graph G=(V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x,y) is in E for each x not equal to y.
Kitaev, Sergey +3 more
core +2 more sources
Oriented gain graphs, line graphs and eigenvalues [PDF]
Linear Algebra and its Applications, 2016 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