On universal graphs for planar oriented graphs of a given girth
From MaRDI portal
Publication:1584330
DOI10.1016/S0012-365X(97)00276-8zbMATH Open0956.05041OpenAlexW1985391430MaRDI QIDQ1584330FDOQ1584330
Authors: Oleg V. Borodin, Alexandr Kostochka, J. Nešetřil, André Raspaud, Éric Sopena 
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00276-8
Recommendations
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- scientific article; zbMATH DE number 830027
- scientific article; zbMATH DE number 1305403
- On universal point sets for planar graphs
- On universal point sets for planar graphs
- A note on universal point sets for planar graphs
- A Note on Universal Point Sets for Planar Graphs
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Small universal graphs for bounded-degree planar graphs
Cites Work
- On the complexity of H-coloring
- On the maximum average degree and the oriented chromatic number of a graph
- Good and semi-strong colorings of oriented planar graphs
- Colorings and girth of oriented planar graphs
- Acyclic and oriented chromatic numbers of graphs
- The chromatic number of oriented graphs
- 25 pretty graph colouring problems
- Duality and Polynomial Testing of Tree Homomorphisms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universality of \(A\)-mote graphs
Cited In (18)
- Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\)
- On induced-universal graphs for the class of bounded-degree graphs
- Coloring graphs in oriented coloring of cubic graphs
- Existence and nonexistence of universal graphs
- Antisymmetric flows and strong colourings of oriented graphs
- Homomorphisms and colourings of oriented graphs: an updated survey
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets
- Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\)
- Oriented total-coloring of oriented graphs
- On the oriented chromatic number of grids
- Homomorphisms from sparse graphs with large girth.
- On deeply critical oriented graphs
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth
- On the existence and non-existence of improper homomorphisms of oriented and \(2\)-edge-coloured graphs to reflexive targets
- On nice graphs
- A universality theorem for stressable graphs in the plane
- On oriented graphs with certain extension properties.
This page was built for publication: On universal graphs for planar oriented graphs of a given girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584330)
