Good and semi-strong colorings of oriented planar graphs
From MaRDI portal
Publication:1334637
DOI10.1016/0020-0190(94)00088-3zbMath0806.05031OpenAlexW2154567859WikidataQ115927015 ScholiaQ115927015MaRDI QIDQ1334637
Publication date: 25 September 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00088-3
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Homomorphisms and colourings of oriented graphs: an updated survey, Homomorphism bounded classes of graphs, A note on the oriented chromatic number of grids, Oriented colorings of triangle-free planar graphs, An oriented 6-coloring of planar graphs with girth at least 9, Oriented chromatic number of Cartesian products and strong products of paths, Unnamed Item, On the oriented chromatic number of Halin graphs, On fractional version of oriented coloring, The 2-dipath chromatic number of Halin graphs, Oriented vertex and arc colorings of outerplanar graphs, Oriented colorings of 2-outerplanar graphs, On oriented relative clique number, Colorings and girth of oriented planar graphs, Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \), The acircuitic directed star arboricity of subcubic graphs is at most four, On homomorphisms of oriented graphs with respect to the push operation, Homomorphism bounds for oriented planar graphs of given minimum girth, Analogues of cliques for \((m,n)\)-colored mixed graphs, The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial, Injectively \(k\)-colored rooted forests, Chromatic polynomials of 2-edge-coloured graphs, Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs, Oriented chromatic number of grids is greater than 7, On the adaptable chromatic number of graphs, On the oriented achromatic number of graphs, A homomorphic polynomial for oriented graphs, On Chromatic Number of Colored Mixed Graphs, Antisymmetric flows and strong oriented coloring of planar graphs, \(L(2,1)\)-labelings of some families of oriented planar graphs, Homomorphisms and oriented colorings of equivalence classes of oriented graphs, Antisymmetric flows and edge-connectivity, \(L(2,1)\)-labeling of oriented planar graphs, Oriented colourings of graphs with maximum degree three and four, Concepts of signed graph coloring, Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs, Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs, Homomorphisms of 2-edge-colored graphs, Homomorphisms of 2-edge-colored graphs, A study on oriented relative clique number, Weak acyclic coloring and asymmetric coloring games, Unnamed Item, Oriented colorings of partial 2-trees, On the oriented chromatic number of graphs with given excess, Folding, Acyclic colouring of 1-planar graphs, Sharp thresholds for constraint satisfaction problems and homomorphisms, Obstructions to locally injective oriented improper colourings, On the oriented chromatic number of grids, Smaller universal targets for homomorphisms of edge-colored graphs, Outerplanar and Planar Oriented Cliques, Oriented cliques and colorings of graphs with low maximum degree, Homomorphisms of edge-colored graphs and Coxeter groups, An oriented coloring of planar graphs with girth at least five, On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets, On acyclically 4-colorable maximal planar graphs, Chromatic polynomials of oriented graphs, Homomorphisms of sparse signed graphs, Acyclic \(k\)-strong coloring of maps on surfaces, Antisymmetric flows and strong colourings of oriented graphs, On universal graphs for planar oriented graphs of a given girth, Colored homomorphisms of colored mixed graphs, Equitable partition of graphs into induced forests, Homomorphisms of Signed Graphs, The oriented chromatic number of Halin graphs, On the oriented coloring of the disjoint union of graphs, Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
Cites Work
- Unnamed Item
- On the complexity of H-coloring
- Colorings and interpretations: a connection between graphs and grammar forms
- Every planar graph has an acyclic 7-coloring
- On acyclic colorings of planar graphs
- Parallel concepts in graph theory
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Every planar graph has an acyclic 8-coloring
- Decomposition of Finite Graphs Into Forests
- Acyclic colorings of planar graphs
