Facial parity edge colouring of plane pseudographs (Q442406): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q582576
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Stanlislav Jendroľ / 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.1016/j.disc.2012.03.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024733865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal strong parity edge-coloring of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity vertex coloring of outerplane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facial parity edge colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity vertex colouring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge partition of planar sraphs into two outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the edges of a graph by three odd subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs of maximum degree seven are Class I / rank
 
Normal rank

Latest revision as of 13:47, 5 July 2024

scientific article
Language Label Description Also known as
English
Facial parity edge colouring of plane pseudographs
scientific article

    Statements

    Facial parity edge colouring of plane pseudographs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    0 references
    plane graph
    0 references
    facial walk
    0 references
    edge colouring
    0 references
    0 references