Coloring face-hypergraphs of graphs on surfaces

DOI10.1006/JCTB.2001.2107MaRDI QIDQ1850616zbMATH OpenOpenAlexFDO

Authors André Kündgen, Radhika Ramamurthi

Publication date 10 December 2002

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.2001.2107

zbMATH Keywords

choosabilitytopological graph theory

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Coloring face hypergraphs on surfaces
• Colouring vertices of plane graphs under restrictions given by faces
• Facial list colourings of plane graphs
• The edge-face choosability of plane graphs
• 3-Colorability of plane hypergraphs

Cites work

• scientific article; zbMATH DE number 4014740 (Why is no real title available?)
• scientific article; zbMATH DE number 3981181 (Why is no real title available?)
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3697143 (Why is no real title available?)
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3475491 (Why is no real title available?)
• scientific article; zbMATH DE number 3522002 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1021588 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 863474 (Why is no real title available?)
• scientific article; zbMATH DE number 890665 (Why is no real title available?)
• scientific article; zbMATH DE number 3279789 (Why is no real title available?)
• A Lower Bound for Heilbronn'S Problem
• An Analogue to the Heawood Map-Colouring Problem
• Color-critical graphs on a fixed surface
• Coloring Block Designs is NP-Complete
• Coloring Steiner Triple Systems
• Coloring graphs without short non-bounding cycles
• Coloring locally bipartite graphs on surfaces.
• Colorings and orientations of graphs
• Colouring Eulerian triangulations
• Colouring planar mixed hypergraphs
• Dirac's map-color theorem for choosability
• Embedding graphs in surfaces
• Every planar graph is 5-choosable
• Every planar map is four colorable. I: Discharging
• Exponential families of non-isomorphic triangulations of complete graphs
• Face 2-colourable triangular embeddings of complete graphs
• Five-coloring maps on surfaces
• Graph theory with applications
• Graphs on surfaces
• HYPERGRAPHS
• How to determine the maximum genus of a graph
• Hypermaps versus bipartite maps
• List colourings of planar graphs
• Multicriterial graph problems with MAXMIN criterion
• On chromatic number of graphs and set-systems
• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• Partial list colorings
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Surface embeddings of Steiner triple systems
• The Grötzsch theorem for the hypergraph of maximal cliques
• The complexity of planar graph choosability
• The number of cycles in 2-factors of cubic graphs
• Three nonisomorphic triangulations of an orientable surface with the same complete graph
• Uniqueness and faithfulness of embedding of toroidal graphs

Cited in

(20)

• List 4-colouring of planar graphs
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Coloring parameters for graphs on surfaces
• Coloring face hypergraphs on surfaces
• Coloring vertices and faces of maps on surfaces
• Transversals and colorings of simplicial spheres
• Embeddings of a graph into a surface with different weak chromatic numbers
• Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
• On maximum face-constrained coloring of plane graphs with no short face cycles.
• scientific article; zbMATH DE number 2230310 (Why is no real title available?)
• On the 4-color theorem for signed graphs
• Chromatic numbers of simplicial manifolds
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Maximum face-constrained coloring of plane graphs
• Unique-maximum coloring of plane graphs
• A refinement of choosability of graphs
• The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
• Spanning quadrangulations of triangulated surfaces
• 2-list-coloring planar graphs without monochromatic triangles
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum

This page was built for publication: Coloring face-hypergraphs of graphs on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850616)