Pages that link to "Item:Q3129826"
From MaRDI portal
The following pages link to Acyclic and oriented chromatic numbers of graphs (Q3129826):
Displaying 50 items.
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- Complete oriented colourings and the oriented achromatic number (Q400508) (← links)
- Oriented chromatic number of grids is greater than 7 (Q413252) (← links)
- Enumeration of Golomb rulers and acyclic orientations of mixed graphs (Q456386) (← links)
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms (Q522969) (← links)
- Improved bounds for acyclic chromatic index of planar graphs (Q534360) (← links)
- A note on the oriented chromatic number of grids (Q834897) (← links)
- Analysis of a heuristic for acyclic edge colouring (Q845729) (← links)
- The acircuitic directed star arboricity of subcubic graphs is at most four (Q856877) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- Acyclic edge coloring of subcubic graphs (Q998411) (← links)
- An oriented coloring of planar graphs with girth at least five (Q1025464) (← 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)
- The game coloring number of planar graphs (Q1305532) (← links)
- Colorings and girth of oriented planar graphs (Q1356774) (← links)
- Antisymmetric flows and strong oriented coloring of planar graphs (Q1417578) (← links)
- On universal graphs for planar oriented graphs of a given girth (Q1584330) (← links)
- Oriented incidence colourings of digraphs (Q1630937) (← 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)
- Searching for acyclic orientations of graphs (Q1898338) (← links)
- Forbidden subgraph colorings and the oriented chromatic number (Q1933644) (← links)
- Acyclic edge coloring of graphs with large girths (Q1934376) (← links)
- Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph (Q2073290) (← links)
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) (Q2151213) (← links)
- Complete acyclic colorings (Q2185231) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← 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)
- The oriented chromatic number of Halin graphs (Q2350598) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- Acyclic edge coloring of planar graphs with girth at least 5 (Q2446889) (← links)
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs (Q2494116) (← links)
- On the oriented chromatic number of graphs with given excess (Q2497471) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- Coloring graphs in oriented coloring of cubic graphs (Q2674380) (← links)
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs (Q2701005) (← links)
- On Chromatic Number of Colored Mixed Graphs (Q2971641) (← links)
- Acyclic edge coloring of 2-degenerate graphs (Q3113277) (← links)
- Strong oriented chromatic number of planar graphs without cycles of specific lengths (Q3503527) (← links)
- Acyclic edge coloring of graphs with maximum degree 4 (Q3652530) (← links)
- Graph colorings and acyclic orientations (Q3768909) (← links)
- On unavoidable digraphs in orientations of graphs (Q3791169) (← links)
- The chromatic number of oriented graphs (Q4344206) (← links)
