Make a graph singly connected by edge orientations

DOI10.1007/978-3-031-34347-6_19arXiv2306.02065OpenAlexW4379134874MaRDI QIDQ6182906

Tim A. Hartmann, Komal Muluk

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.02065

zbMATH Keywords

chromatic numbergirthdirected graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Completely separable graphs
• Distance-hereditary graphs
• Determining uni-connectivity in directed graphs
• An \(O(|V|^2)\) algorithm for single connectedness
• On the complexity of singly connected vertex deletion
• On testing single connectedness in directed graphs and some related problems
• Graph Theory
• Graph Theory and Probability
• Noncrossing Subgraphs in Topological Layouts
• A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs

This page was built for publication: Make a graph singly connected by edge orientations