Shorter signed circuit covers of graphs
| dc.contributor.author | Kaiser, Tomáš | |
| dc.contributor.author | Lukoťka, Robert | |
| dc.contributor.author | Máčajová, Edita | |
| dc.contributor.author | Rollová, Edita | |
| dc.date.accessioned | 2019-10-07T10:00:17Z | |
| dc.date.available | 2019-10-07T10:00:17Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract-translated | A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero flow. We show that each flow-admissible signed graph on m edges can be covered by signed circuits of total length at most (3+2/3)m, improving a recent result of Cheng et al. [manuscript, 2015]. To obtain this improvement we prove several results on signed circuit covers of trees of Eulerian graphs, which are connected signed graphs such that removing all bridges results in a collection of Eulerian graphs. | en |
| dc.format | 18 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | KAISER, T., LUKOŤKA, R., MÁČAJOVÁ, E., ROLLOVÁ, E. Shorter signed circuit covers of graphs. Journal of Graph Theory, 2019, roč. 92, č. 1, s. 39-56. ISSN 0364-9024. | en |
| dc.identifier.document-number | 477680800003 | |
| dc.identifier.doi | 10.1002/jgt.22439 | |
| dc.identifier.issn | 0364-9024 | |
| dc.identifier.obd | 43926744 | |
| dc.identifier.uri | 2-s2.0-85058408444 | |
| dc.identifier.uri | http://hdl.handle.net/11025/35177 | |
| dc.language.iso | en | en |
| dc.project.ID | GA17-04611S/Ramseyovské aspekty barvení grafů | cs |
| dc.project.ID | GA14-19503S/Barevnost a struktura grafů | cs |
| dc.project.ID | LO1506/PUNTIS - Podpora udržitelnosti centra NTIS - Nové technologie pro informační společnost | cs |
| dc.relation.ispartofseries | Journal of Graph Theory | en |
| dc.rights | Plný text není přístupný. | cs |
| dc.rights | © Wiley | en |
| dc.rights.access | closedAccess | en |
| dc.subject.translated | short circuit cover | en |
| dc.subject.translated | signed circuit | en |
| dc.subject.translated | signed graph | en |
| dc.title | Shorter signed circuit covers of graphs | en |
| dc.title.alternative | Kratší pokrytí signovanými kružnicemi v grafech | cs |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.type.status | Peer-reviewed | en |
| dc.type.version | publishedVersion | en |