Pages that link to "Item:Q4344206"
From MaRDI portal
The following pages link to The chromatic number of oriented graphs (Q4344206):
Displaying 50 items.
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- On oriented relative clique number (Q324737) (← links)
- Complete oriented colourings and the oriented achromatic number (Q400508) (← links)
- Oriented chromatic number of grids is greater than 7 (Q413252) (← links)
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- Colourings of oriented connected cubic graphs (Q785820) (← links)
- A note on the oriented chromatic number of grids (Q834897) (← links)
- On the oriented chromatic number of Halin graphs (Q844210) (← links)
- The 2-dipath chromatic number of Halin graphs (Q845671) (← links)
- Oriented vertex and arc colorings of outerplanar graphs (Q845839) (← links)
- Oriented colorings of 2-outerplanar graphs (Q845933) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- On the chromatic number of an oriented matroid (Q933674) (← links)
- Oriented colorings of partial 2-trees (Q975406) (← links)
- On induced-universal graphs for the class of bounded-degree graphs (Q975466) (← links)
- On the oriented chromatic number of grids (Q1007541) (← links)
- Acyclic and \(k\)-distance coloring of the grid (Q1014392) (← links)
- An oriented coloring of planar graphs with girth at least five (Q1025464) (← links)
- Homomorphisms of edge-colored graphs and Coxeter groups (Q1272907) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- A bound for the game chromatic number of graphs (Q1297403) (← links)
- On the maximum average degree and the oriented chromatic number of a graph (Q1304809) (← links)
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs (Q1421519) (← links)
- Antisymmetric flows and edge-connectivity (Q1422419) (← links)
- On universal graphs for planar oriented graphs of a given girth (Q1584330) (← links)
- Oriented chromatic number of Cartesian products and strong products of paths (Q1630938) (← links)
- Oriented colourings of graphs with maximum degree three and four (Q1727768) (← links)
- A study on oriented relative clique number (Q1752681) (← links)
- Colored homomorphisms of colored mixed graphs (Q1850491) (← links)
- On deeply critical oriented graphs (Q1850516) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- Forbidden subgraph colorings and the oriented chromatic number (Q1933644) (← links)
- Oriented trees in digraphs (Q1946667) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- On the oriented coloring of the disjoint union of graphs (Q2115853) (← links)
- Trees contained in every orientation of a graph (Q2138584) (← links)
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) (Q2151213) (← links)
- On relative clique number of triangle-free planar colored mixed graphs (Q2169979) (← links)
- A note on the orientation covering number (Q2231779) (← links)
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs (Q2232245) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Oriented cliques and colorings of graphs with low maximum degree (Q2305935) (← links)
- Lower bounds of the skew spectral radii and skew energy of oriented graphs (Q2348013) (← links)
- The oriented chromatic number of Halin graphs (Q2350598) (← links)
- Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043) (← links)
- On homomorphisms of oriented graphs with respect to the push operation (Q2397542) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
- \(L(2,1)\)-labelings of some families of oriented planar graphs (Q2442267) (← links)
- On the oriented chromatic number of graphs with given excess (Q2497471) (← links)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
