scientific article; zbMATH DE number 6004911

MaRDI QIDQ3115643zbMATH OpenFDO

Authors V. G. Vizing

Publication date 10 February 2012

zbMATH Keywords

computer network schedulinghyperarcincidentor coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited in

(1)

• Incidence coloring of mycielskians with fast algorithm

This page was built for publication:

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