Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3115558
Jump to:navigation, search

zbMath1249.05142MaRDI QIDQ3115558

Vadim G. Vizing

Publication date: 10 February 2012


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

minimum number of colorsproper coloringincidentors


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)


Related Items (3)

On an interval (1, 1)-coloring of incidentors of interval colorable graphs ⋮ Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem ⋮ On list incidentor (k, l)-coloring







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3115558&oldid=16205534"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki