Q4719322 (Q4719322): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 10:50, 29 May 2024

scientific article; zbMATH DE number 1383699

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 1383699

Statements

scholarly article

0 references

S. Louis Hakimi

0 references

Edward F. Schmeichel

0 references

publication date

9 April 2000

0 references

zbMATH Keywords

chromatic index

0 references

multigraph

0 references

edge multiplicity

0 references

MaRDI profile type

MaRDI publication profile

0 references

On edge-colorings of graphs.

0 references

A short proof for a generalization of Vizing's theorem

0 references

0 references

On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index

0 references

Data transfers in networks

0 references

Edge-coloring of multigraphs: Recoloring technique

0 references

A generalization of edge-coloring in graphs

0 references

Degree‐bounded coloring of graphs: Variations on a theme by brooks

0 references

Class one graphs

0 references

The NP-Completeness of Edge-Coloring

0 references

<i>k</i>-Degenerate Graphs

0 references

A Theorem on Coloring the Lines of a Network

0 references

An inequality for the chromatic number of a graph

0 references

An upper bound for the chromatic number of a graph and its application to timetabling problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1002/(SICI)1097-0118(199912)32:4<311::AID-JGT1>3.0.CO;2-X

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4719322

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4719322&oldid=34232470"