Orientation of signed graphs

From MaRDI portal
Publication:1178039

DOI10.1016/S0195-6698(13)80118-7zbMath0761.05095OpenAlexW1981244742MaRDI QIDQ1178039

Thomas Zaslavsky

Publication date: 26 June 1992

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80118-7




Related Items (58)

Characterizations of line graphs in signed and gain graphsA connection between Hadamard matrices, oriented hypergraphs and signed graphsOriented hypergraphs: balanceabilityA spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphsOn the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of GraphsUnnamed ItemFlow number and circular flow number of signed cubic graphsTotal graph of a signed graphOn eigenspaces of some compound signed graphsSpectral characterizations of signed cyclesRecognizing binet matricesCircuit Covers of Signed GraphsThe number of nowhere-zero flows on graphs and signed graphsThe odd-valued chromatic polynomial of a signed graphResolution of indecomposable integral flows on signed graphsA characterization of oriented hypergraphic Laplacian and adjacency matrix coefficientsFourientations and the Tutte polynomialDecomposition of a bidirected graph into strongly connected components and its signed poset structureOn the determinant of the Laplacian matrix of a complex unit gain graphOriented hypergraphs: introduction and balanceConformal Decomposition of Integral Tensions and Potentials of Signed GraphsOn colorings and orientations of signed graphsNowhere-Zero Flows on Signed Eulerian GraphsGeneralizing Kirchhoff laws for Signed GraphsSigned graphsBiased graphs IV: Geometrical realizationsAn oriented hypergraphic approach to algebraic graph theorySigned graph coloringCircular flow on signed graphsGain-line graphs via \(G\)-phases and group representationsDuke's theorem does not extend to signed graph embeddingsA bivariate chromatic polynomial for signed graphsIterated local transitivity model for signed social networksMorphisms and order ideals of toric posetsFlows in 3-edge-connected bidirected graphsTorsion formulas for signed graphsInside-out polytopesFlow-contractible configurations and group connectivity of signed graphsRemarks on nowhere-zero flows in signed cubic graphsOn a relation between the domination number and a strongly connected bidirection of an undirected graphOriented gain graphs, line graphs and eigenvaluesThe flow and tension spaces and lattices of signed graphsA characterization of oriented hypergraphic balance via signed weak walksMaking bidirected graphs strongly connectedIncidence hypergraphs: injectivity, uniformity, and matrix-tree theoremsConformal decomposition of integral flows on signed graphs with outer-edgesSigned graph factors and degree sequencesTransitive closure and transitive reduction in bidirected graphsOriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order idealsA bidirected generalization of network matricesRoot polytopes, triangulations, and the subdivision algebra, IIA simple algorithm that proves half‐integrality of bidirected network programmingSpectra of cycle and path families of oriented hypergraphsFlow polynomials of a signed graphUnlabeled signed graph coloringNowhere-zero integral flows on a bidirected graphPruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedraA Combinatorial Proof of the All Minors Matrix Tree Theorem



Cites Work


This page was built for publication: Orientation of signed graphs