Pages that link to "Item:Q1334637"
From MaRDI portal
The following pages link to Good and semi-strong colorings of oriented planar graphs (Q1334637):
Displaying 50 items.
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- An oriented 6-coloring of planar graphs with girth at least 9 (Q293643) (← links)
- On oriented relative clique number (Q324737) (← links)
- Homomorphism bounds for oriented planar graphs of given minimum girth (Q367080) (← links)
- Oriented chromatic number of grids is greater than 7 (Q413252) (← links)
- Homomorphisms of sparse signed graphs (Q782945) (← links)
- A note on the oriented chromatic number of grids (Q834897) (← links)
- Oriented colorings of triangle-free planar graphs (Q834898) (← 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)
- The acircuitic directed star arboricity of subcubic graphs is at most four (Q856877) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- Oriented colorings of partial 2-trees (Q975406) (← links)
- On the oriented chromatic number of grids (Q1007541) (← 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)
- Colorings and girth of oriented planar graphs (Q1356774) (← links)
- Antisymmetric flows and strong oriented coloring of planar graphs (Q1417578) (← links)
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs (Q1421519) (← links)
- Antisymmetric flows and edge-connectivity (Q1422419) (← links)
- Acyclic \(k\)-strong coloring of maps on surfaces (Q1581455) (← 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 the oriented coloring of the disjoint union of graphs (Q2115853) (← links)
- On fractional version of oriented coloring (Q2143042) (← links)
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) (Q2151213) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Oriented cliques and colorings of graphs with low maximum degree (Q2305935) (← links)
- On acyclically 4-colorable maximal planar graphs (Q2318233) (← links)
- Chromatic polynomials of oriented graphs (Q2325756) (← links)
- Equitable partition of graphs into induced forests (Q2342637) (← links)
- The oriented chromatic number of Halin graphs (Q2350598) (← links)
- Homomorphism bounded classes of graphs (Q2368718) (← links)
- On homomorphisms of oriented graphs with respect to the push operation (Q2397542) (← links)
- Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- \(L(2,1)\)-labelings of some families of oriented planar graphs (Q2442267) (← links)
- \(L(2,1)\)-labeling of oriented planar graphs (Q2446298) (← links)
- Weak acyclic coloring and asymmetric coloring games (Q2488942) (← links)
- On the oriented chromatic number of graphs with given excess (Q2497471) (← links)
- Folding (Q2498742) (← links)
- Obstructions to locally injective oriented improper colourings (Q2509767) (← links)
- A homomorphic polynomial for oriented graphs (Q2692188) (← links)
- Outerplanar and Planar Oriented Cliques (Q2811201) (← links)
