Circuit k-covers of signed graphs
From MaRDI portal
Publication:2656955
DOI10.1016/J.DAM.2021.01.024zbMATH Open1459.05111OpenAlexW3131573761MaRDI QIDQ2656955FDOQ2656955
Authors: Jing Chen, Genghua Fan 
Publication date: 17 March 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.01.024
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Signed and weighted graphs (05C22) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Title not available (Why is that?)
- On flows in bidirected graphs
- Circuit covers of signed graphs
- Covering Multigraphs by Simple Circuits
- Shortest coverings of graphs with cycles
- Integer flows and cycle covers
- Nowhere-zero flows on signed Eulerian graphs
- Minimum \(T\)-joins and signed-circuit covering
- Shortest circuit covers of signed graphs
- Short signed circuit covers of signed graphs
- Circuit covers of signed Eulerian graphs
- Shorter signed circuit covers of graphs
Cited In (10)
- Shorter signed circuit covers of graphs
- Title not available (Why is that?)
- Circuit covers of cubic signed graphs
- Shortest circuit covers of signed graphs
- Short signed circuit covers of signed graphs
- Characteristic flows on signed graphs and short circuit covers
- Circuit covers of signed Eulerian graphs
- Circuit covers of signed Eulerian graphs
- A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs
- Circuit covers of signed graphs
This page was built for publication: Circuit \(k\)-covers of signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656955)
