On universal graphs for planar oriented graphs of a given girth (Q1584330): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the maximum average degree and the oriented chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of \(A\)-mote graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and Polynomial Testing of Tree Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic and oriented chromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and girth of oriented planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good and semi-strong colorings of oriented planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of oriented graphs / rank
 
Normal rank

Revision as of 16:05, 30 May 2024

scientific article
Language Label Description Also known as
English
On universal graphs for planar oriented graphs of a given girth
scientific article

    Statements

    On universal graphs for planar oriented graphs of a given girth (English)
    0 references
    2 November 2000
    0 references
    oriented chromatic number
    0 references
    oriented graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers