Coloring face-hypergraphs of graphs on surfaces (Q1850616): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1006/jctb.2001.2107 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069662110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac's map-color theorem for choosability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential families of non-isomorphic triangulations of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Steiner Triple Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Block Designs is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs without short non-bounding cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face 2-colourable triangular embeddings of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surface embeddings of Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of planar graph choosability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding graphs in surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Eulerian triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for Heilbronn'S Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analogue to the Heawood Map-Colouring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring planar mixed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three nonisomorphic triangulations of an orientable surface with the same complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring locally bipartite graphs on surfaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grötzsch theorem for the hypergraph of maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness and faithfulness of embedding of toroidal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3027024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cycles in 2-factors of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-coloring maps on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-critical graphs on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypermaps versus bipartite maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: HYPERGRAPHS / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:12, 4 June 2024

scientific article
Language Label Description Also known as
English
Coloring face-hypergraphs of graphs on surfaces
scientific article

    Statements

    Coloring face-hypergraphs of graphs on surfaces (English)
    0 references
    0 references
    0 references
    10 December 2002
    0 references
    topological graph theory
    0 references
    choosability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers