Old and new generalizations of line graphs.
Page 1
Displaying 1 – 12 of 12
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Július Czap, Jakub Przybyło, Erika Škrabuľáková (2016)
Discussiones Mathematicae Graph Theory
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets. Bipartite 1-planar graphs are known to have at most 3n − 8 edges, where n denotes the order of a graph. We show that maximal-size bipartite 1-planar graphs which are almost balanced have not significantly fewer edges than indicated by this upper bound, while the same is not true...
On linear layouts of graphs.
Dujmović, Vida, Wood, David R. (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
On metro-line crossing minimization.
Argyriou, Evmorfia, Bekos, Michael A., Kaufmann, Michael, Symvonis, Antonios (2010)
Journal of Graph Algorithms and Applications
On rational radii coin representations of the wheel graph
Geir Agnarsson, Jill Bigley Dunham (2013)
Discussiones Mathematicae - General Algebra and Applications
A flower is a coin graph representation of the wheel graph. A petal of a flower is an outer coin connected to the center coin. The results of this paper are twofold. First we derive a parametrization of all the rational (and hence integer) radii coins of the 3-petal flower, also known as Apollonian circles or Soddy circles. Secondly we consider a general n-petal flower and show there is a unique irreducible polynomial Pₙ in n variables over the rationals ℚ, the affine variety of which contains the...
On recognition of strong graph bundles
Janez Žerovnik (2000)
Mathematica Slovaca
On recursively directed hypercubes.
Domshlak, Carmel (2002)
The Electronic Journal of Combinatorics [electronic only]
On the graphs of Hoffman-Singleton and Higman-Sims.
Hafner, Paul R. (2004)
The Electronic Journal of Combinatorics [electronic only]
On the perspectives opened by right angle crossing drawings.
Angelini, Patrizio, Cittadini, Luca, Didimo, Walter, Frati, Fabrizio, Di Battista, Giuseppe, Kaufmann, Michael, Symvonis, Antonios (2011)
Journal of Graph Algorithms and Applications
Orientation distance graphs revisited
Wayne Goddard, Kiran Kanakadandi (2007)
Discussiones Mathematicae Graph Theory
The orientation distance graph 𝓓ₒ(G) of a graph G is defined as the graph whose vertex set is the pair-wise non-isomorphic orientations of G, and two orientations are adjacent iff the reversal of one edge in one orientation produces the other. Orientation distance graphs was introduced by Chartrand et al. in 2001. We provide new results about orientation distance graphs and simpler proofs to existing results, especially with regards to the bipartiteness of orientation distance graphs and the representation...
Orthogonal drawings of plane graphs without bends.
Rahman, Md.Saidur, Nishizeki, Takao, Naznin, Mahmuda (2003)
Journal of Graph Algorithms and Applications
Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions.
Czabarka, Éva, Sýkora, Ondrej, Székely, László A., Vrt'o, Imrich (2004)
The Electronic Journal of Combinatorics [electronic only]
Currently displaying 1 – 12 of 12
Page 1