Negative (and positive) circles in signed graphs: a problem collection
From MaRDI portal
Publication:1643910
DOI10.1016/j.akcej.2018.01.011zbMath1390.05085arXiv1701.07963OpenAlexW2963678483MaRDI QIDQ1643910
Publication date: 20 June 2018
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.07963
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)
Related Items (3)
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity ⋮ Open problems in the spectral theory of signed graphs ⋮ Lower bounds for the least Laplacian eigenvalue of unbalanced blocks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
- On even cycle decompositions of 4-regular line graphs
- Spectral properties of complex unit gain graphs
- Corrigendum to ``Maxima of the \(Q\)-index: forbidden odd cycles
- Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture
- Non-separating even cycles in highly connected graphs
- A linear-time algorithm for computing the intersection of all odd cycles in a graph
- Biased graphs. I: Bias, balance, and gains
- Induced packing of odd cycles in planar graphs
- On local balance and \(n\)-balance in signed graphs
- Balancing signed graphs
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- A simple algorithm to detect balance in signed graphs
- Erratum to: T. Zaslavsky, signed graphs
- Biased graphs. II: The three matroids
- Edge-disjoint odd cycles in graphs with small chromatic numbers
- Packing odd circuits in Eulerian graphs
- Edge-disjoint odd cycles in planar graphs.
- Edges and vertices in a unique signed circle in a signed graph
- Five cycle double covers of some cubic graphs
- A method of enumeration of negative cycles of a signed graph
- Negative cycles in complete signed graphs
- Optimal packings of edge-disjoint odd cycles
- Maxima of the \(Q\)-index: forbidden even cycles
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- A spectral condition for odd cycles in graphs
- Frustrated triangles
- Projective-planar signed graphs and tangled signed graphs
- On the notion of balance of a signed graph
- Strongly Even-Cycle Decomposable Graphs
- Two disjoint negative cycles in a signed graph
- Packing Odd Circuits
- On the complexity of feedback set problems in signed digraphs
- Vertices of Localized Imbalance in a Biased Graph
- Graph Bipartization and via minimization
- Enumeration of weak isomorphism classes of signed graphs
- Characterizations of signed graphs
- Even and odd holes in cap-free graphs
- Even cycles in graphs
- On the Laplacian Eigenvalues of Signed Graphs
- Min-Max Relations for Odd Cycles in Planar Graphs
- Even-hole-free graphs: A survey
- Signless Laplacians and line graphs
- On signed digraphs with all cycles negative
- On signed digraphs with all cycles negative
- The Erdős-Pósa property for odd cycles in highly connected graphs
- The Erdős-Pósa property for odd cycles in graphs of large connectivity
This page was built for publication: Negative (and positive) circles in signed graphs: a problem collection
