Oriented incidence colourings of digraphs (Q1630937): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1112052
Add wikidata reference.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.7151/dmgt.2076 / rank
Normal rank
 
Property / author
 
Property / author: Andre Raspaud / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.2076 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2801104940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Colouring by Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogues of cliques for \((m,n)\)-colored mixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence and strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second order logic of graphs. VI: On several representations of graphs by relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for constant weight codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence coloring of \(k\)-degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms and oriented colorings of equivalence classes of oriented graphs / 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: Q2938238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(C_{k}\)-extended graft construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism bounds for oriented planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of relations and graphs determined by subobjects and factorobjects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Order of a Planar Oclique Is 15 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence coloring of regular graphs and complement graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-families are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the incidence coloring number of a graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7151/DMGT.2076 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129949336 / rank
 
Normal rank

Latest revision as of 10:42, 16 December 2024

scientific article
Language Label Description Also known as
English
Oriented incidence colourings of digraphs
scientific article

    Statements

    Oriented incidence colourings of digraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 December 2018
    0 references
    digraph homomorpism
    0 references
    graph colouring
    0 references
    incidence colouring
    0 references
    computational complexity
    0 references

    Identifiers