Pages that link to "Item:Q4344206"
From MaRDI portal
The following pages link to The chromatic number of oriented graphs (Q4344206):
Displaying 27 items.
- Coloring graphs in oriented coloring of cubic graphs (Q2674380) (← links)
- A homomorphic polynomial for oriented graphs (Q2692188) (← links)
- Oriented list colorings of graphs (Q2725322) (← links)
- On oriented graphs with certain extension properties. (Q2804840) (← links)
- Outerplanar and planar oriented cliques (Q2811201) (← links)
- The simple chromatic number of oriented graphs (Q2816137) (← links)
- Acyclic and oriented chromatic numbers of graphs (Q3129826) (← links)
- Oriented vertex and arc colorings of partial 2-trees (Q3503473) (← links)
- Strong oriented chromatic number of planar graphs without cycles of specific lengths (Q3503527) (← links)
- On unavoidable digraphs in orientations of graphs (Q3791169) (← links)
- Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs (Q4648784) (← links)
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs (Q5891099) (← links)
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs (Q5895186) (← links)
- Homomorphisms of 2-edge-colored graphs (Q5900082) (← links)
- Homomorphisms of 2-edge-colored graphs (Q5901070) (← links)
- Proper orientations and proper chromatic number (Q6038578) (← links)
- Equitable oriented coloring (Q6047973) (← links)
- Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) (Q6157430) (← links)
- The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree (Q6172314) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
- On the oriented achromatic number of graphs (Q6202937) (← links)
- The oriented chromatic number of the hexagonal grid is 6 (Q6559398) (← links)
- Oriented total-coloring of oriented graphs (Q6589144) (← links)
- Oriented vertex and arc coloring of edge series-parallel digraphs (Q6606641) (← links)
- On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters (Q6611087) (← links)
- On coloring parameters of triangle-free planar \((n, m)\)-graphs (Q6640959) (← links)
- Adding direction constraints to the 1-2-3 conjecture (Q6652479) (← links)
