On the proper orientation number of chordal graphs

DOI10.1016/J.TCS.2021.07.031OpenAlexW3185424578MaRDI QIDQ820574FDOQ820574

Authors: 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

Recommendations

• On the proper orientation number of bipartite graphs
• The complexity of the proper orientation number
• Proper orientations of planar bipartite graphs
• Proper orientations and proper chromatic number
• Proper orientation number of triangle-free bridgeless outerplanar graphs

zbMATH Keywords

chordal graphskernelizationsplit graphsproper orientationblock graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Parameterized Algorithms
• Algorithmic Aspects of Vertex Elimination on Graphs
• Quasi-threshold graphs
• The complexity of the proper orientation number
• Proper orientation of cacti
• On the proper orientation number of bipartite graphs
• Weighted proper orientations of trees and graphs of bounded treewidth
• Proper orientations of planar bipartite graphs
• Is there any polynomial upper bound for the universal labeling of graphs?
• Kernelization
• Proper orientation number of triangle‐free bridgeless outerplanar graphs

Cited In (5)

• On the proper orientation number of chordal graphs
• Proper orientations and proper chromatic number
• Complexity of approximating the oriented diameter of chordal graphs
• On the in-out-proper orientations of graphs
• On the proper arc labeling of directed graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820574)