Simultaneous coloring of edges and faces of plane graphs (Q1322167): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Every planar map is four colorable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Colour Numbers of Complete Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3679212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3784093 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the total coloring of planar graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3922703 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5615945 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5578803 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A seven-color theorem on the sphere / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4075398 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3115603 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5564127 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4135588 / rank | |||
Normal rank |
Revision as of 15:31, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Simultaneous coloring of edges and faces of plane graphs |
scientific article |
Statements
Simultaneous coloring of edges and faces of plane graphs (English)
0 references
5 May 1994
0 references
The edge-and-face chromatic number \(\chi_{\text{ef}}(G)\) of a plane graph \(G\) is the least number of colors required to color the edges and faces of \(G\) such that every two adjacent or incident of them receive different colors. It is proved that if \(G\) is a plane graph with maximum degree at least 10 then \(\chi_{\text{ef}}(G)\leq \Delta(G)+1\), the bound being sharp. The proof is based on some new generalizations of Kotzig's Theorem on the minimal weight of edges in plane graphs. It is also proved that if \(G\) is a plane graph without separating triangles and \(\Delta(G)\leq 7\) then \(\chi_{\text{ef}}(G)\leq 10\).
0 references
simultaneous coloring
0 references
edge-and-face chromatic number
0 references
plane graph
0 references
Kotzig's Theorem
0 references