Proper orientations and proper chromatic number
From MaRDI portal
Publication:6038578
DOI10.1016/j.jctb.2023.02.003zbMath1512.05130arXiv2110.07005OpenAlexW4321763399MaRDI QIDQ6038578
Yaobin Chen, Hehui Wu, Bojan Mohar
Publication date: 2 May 2023
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.07005
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Proper orientation of cacti
- Extensions to 2-factors in bipartite graphs
- Sparsity. Graphs, structures, and algorithms
- On the proper orientation number of bipartite graphs
- Coloring chip configurations on graphs and digraphs
- Studies on directed graphs. I, II
- On the proper orientation number of chordal graphs
- The four-colour theorem
- Proper orientations of planar bipartite graphs
- Edge weights and vertex colours
- Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
- The complexity of the proper orientation number
- On the degrees of the vertices of a directed graph
- Iterative Methods in Combinatorial Optimization
- Graphs and Subgraphs
- Every Planar Map is Four Colorable
- Proper orientation number of triangle‐free bridgeless outerplanar graphs
This page was built for publication: Proper orientations and proper chromatic number
