On the proper orientation number of chordal graphs

DOI10.1016/J.TCS.2021.07.031OpenAlexW3185424578MaRDI QIDQ820574

N. E. Zubov

Publication date: 27 September 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

chordal graphssplit graphsblock graphskernelizationproper orientation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Proper orientations and proper chromatic number ⋮ On the proper arc labeling of directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Proper orientation of cacti
• On the proper orientation number of bipartite graphs
• Is there any polynomial upper bound for the universal labeling of graphs?
• Proper orientations of planar bipartite graphs
• Quasi-threshold graphs
• The complexity of the proper orientation number
• Weighted proper orientations of trees and graphs of bounded treewidth
• Algorithmic Aspects of Vertex Elimination on Graphs
• Kernelization
• Proper orientation number of triangle‐free bridgeless outerplanar graphs
• Parameterized Algorithms

This page was built for publication: On the proper orientation number of chordal graphs