A graph with signed arcs is oriented by directing each end of each arc in accordance with a sign-compatibility rule. We prove that the regions of the hyperplane representation of a signed graph ∑, as well as the vertices of the convex hull of all degree vectors of orientations of ∑, are in natural one-to-one correspondence with the cyclic orientations of ∑ The proof uses the oriented matroid of a signed graph. For use elsewhere, we also develop the relationships between orientations and hyperplane representations of a signed graph and those of its double covering graph
International audienceA signed graph [G, Σ] is a graph G together with an assignment of signs + and ...
The acyclic orientation graph, AO(G), of an undirected graph, G, is the graph whose vertices are th...
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogou...
A graph with signed arcs is oriented by directing each end of each arc in accordance with a sign-com...
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matr...
A classical theorem independently due to Gallai and Roy states that a graph G has a proper k-colorin...
The fundamental concepts of graph theory are cycles, Eulerian graphs, bonds, cuts, spanning trees an...
AbstractWe continue the study initiated in “Signed graph coloring” of the chromatic and Whitney poly...
Several well-known graph invariants have a geometric interpretation via hyperplane arrangements.\ud ...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.Cataloged fro...
Orienting an undirected graph means replacing each edge by an arc with the same ends. We investigate...
We show that the orientation class of an oriented matroid of corank ⩾ 3 is completely determined by ...
AbstractColoring a signed graph by signed colors, one has a chromatic polynomial with the same enume...
This paper contains a description of a connection between the matching arrangement and the matching ...
AbstractAn oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of ...
International audienceA signed graph [G, Σ] is a graph G together with an assignment of signs + and ...
The acyclic orientation graph, AO(G), of an undirected graph, G, is the graph whose vertices are th...
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogou...
A graph with signed arcs is oriented by directing each end of each arc in accordance with a sign-com...
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matr...
A classical theorem independently due to Gallai and Roy states that a graph G has a proper k-colorin...
The fundamental concepts of graph theory are cycles, Eulerian graphs, bonds, cuts, spanning trees an...
AbstractWe continue the study initiated in “Signed graph coloring” of the chromatic and Whitney poly...
Several well-known graph invariants have a geometric interpretation via hyperplane arrangements.\ud ...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.Cataloged fro...
Orienting an undirected graph means replacing each edge by an arc with the same ends. We investigate...
We show that the orientation class of an oriented matroid of corank ⩾ 3 is completely determined by ...
AbstractColoring a signed graph by signed colors, one has a chromatic polynomial with the same enume...
This paper contains a description of a connection between the matching arrangement and the matching ...
AbstractAn oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of ...
International audienceA signed graph [G, Σ] is a graph G together with an assignment of signs + and ...
The acyclic orientation graph, AO(G), of an undirected graph, G, is the graph whose vertices are th...
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogou...