Dual Connectedness of Edge-Bicolored Graphs and Beyond

DOI10.1007/978-3-662-44465-8_13zbMath1426.05162OpenAlexW17162922MaRDI QIDQ2922603

Leizhen Cai, Junjie Ye

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_13

zbMATH Keywords

dual separatordually connectededge-bicolored graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

Assessing the Computational Complexity of Multi-layer Subgraph Detection, Simultaneous feedback edge set: a parameterized perspective, Parameterized complexity of finding connected induced subgraphs, Unnamed Item, Necessary and sufficient conditions for consensus in nonlinear monotone networks with unilateral interactions, Cluster Editing in Multi-Layer and Temporal Graphs., Unnamed Item