… based on these graphs. In this correspondence, we isolate a subclass of orthogonal graphs
with … For this latter class, we provide an algorithm for the shortest path routing and a complete …

… orthogonal representations). Our main result in Section 1 says that G has a general-position
orthogonal … We shall also prove a related result for directed graphs. Thus it seems that …

… G has an orthogonal subgraph, and every subgraph of G is orthogonal to some … graph KÂ
‚n has a pair of orthogonal 1factorizations F and G if and only if there exists a pair of orthogonal …

… graph parameters such as the maximum degree and the chromatic number. We also study
the structure of graphs having an optimal or perfect orthogonal … of a graph having a POC is C9…

… in the least dimension of an orthogonal representation of a graph G for fixed parameters F;
S; A; B. When the … Real orthogonal representations with parameters S = A = R and B …

… Given a coloring of the edges of a graph H with k colors, at every vertex v of H we obtain … of
edges incident with a vertex in a graph but also to define a certain set function: for a set S and …

… In this paper it is proved that every (mg + k; mf − k)-graph contains a subgraph R such that
R has a (g; f)-factorization orthogonal to a given subgraph with k edges, where m and k are …

… dimension of an orthogonal representation of a graph over a finite field … a graph the 3-colorability
problem is equivalent to deciding whether the class defined by the graph contains a …

… drawings and their optimization in the following sections, we now describe a way to encode
a graph and a drawing of a graph, such that we can use these encodings for input and …

… a finite graph and GΓ be the corresponding free partially commutative group. In this paper
we construct orthogonality theory for graphs … If x and y are vertices of a graph then we define …