An orientation of a graph ▫$G$▫ is proper if any two adjacent vertices have different indegrees so that the values of the indegrees define a coloring of ▫$G$▫ . The proper orientation number ...▫$\overrightarrow{\chi}(G)$▫ of a graph ▫$G$▫ is the minimum of the maximum indegree, taken over all proper orientations of ▫$G$▫. In this paper, we show that a connected bipartite graph may be properly oriented even if we are only allowed to control the orientation of a specific set of edges, namely, the edges of a spanning tree and all the edges incident to one of its leaves. By using the same technique, we prove that 3-connected planar bipartite graphs have proper orientation number at most 5. This statement is the most general result in support of the open problem of whether all planar graphs have bounded proper orientation number. Additionally, we give a short proof that ▫$\overrightarrow{\chi}(G) \leq 4$▫, when ▫$G$▫ is a tree and this proof leads to a polynomial-time algorithm to properly orient trees within this bound.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
PDF
