Maximum versus minimum invariants for graphs

DOI10.1002/JGT.3190070302zbMATH Open0515.05053OpenAlexW197939587MaRDI QIDQ3661618FDOQ3661618

Frank Harary

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070302

zbMATH Keywords

chromatic numbergenusachromatic numbermaximum genuspair of invariantspairings of parameters

Mathematics Subject Classification ID

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

Cites Work

• The Genus, Regional Number, and Betti Number of a Graph
• Maximal Rectilinear Crossing of Cycles
• Title not available (Why is that?)

Cited In (6)

• A survey of the theory of hypercube graphs
• The b-chromatic number of a graph
• Title not available (Why is that?)
• Covering and packing in graphs. V. Mispacking subcubes in hypercubes
• On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
• Interpolation theorems for domination numbers of a graph

This page was built for publication: Maximum versus minimum invariants for graphs

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