Maximum genus and chromatic number of graphs

DOI10.1016/S0012-365X(03)00289-9zbMath1022.05020OpenAlexW2061324239MaRDI QIDQ1408870

Yuan Qiu Huang

Publication date: 25 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00289-9

zbMATH Keywords

chromatic numbermaximum genusBetti deficiency

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (5)

Results of the maximum genus of graphs ⋮ A sufficient condition on upper embeddability of graphs ⋮ Up-embeddability via girth and the degree-sum of adjacent vertices ⋮ Upper embeddability, girth and the degree-sum of nonadjacent vertices ⋮ Upper embeddability, edge independence number and girth

Cites Work

• How to determine the maximum genus of a graph
• The maximum genus of graphs with diameter three
• Maximum genus and girth of graphs
• Maximum genus and maximum nonseparating independent set of a 3-regular graph
• The maximum genus on a 3-vertex-connected graph
• Maximum genus and connectivity
• A tight lower bound on the maximum genus of a simplicial graph
• The maximum genus of graphs of diameter two
• On the maximum genus of a graph
• On locally quasiconnected graphs and their upper embeddability
• A class of upper-embeddable graphs
• Every connected, locally connected graph is upper embeddable
• A new characterization of the maximum genus of a graph
• $N_2$-locally connected graphs and their upper embeddability
• A Characterization in of Upper-Embeddable Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum genus and chromatic number of graphs