On edge-colouring indifference graphs (Q1391299)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On edge-colouring indifference graphs	scientific article

Statements

scholarly article

0 references

On edge-colouring indifference graphs (English)

0 references

0 references

Célia Picinin de Mello

0 references

Celina M. Herrera de Figueiredo

0 references

Theoretical Computer Science

0 references

publication date

22 July 1998

0 references

zbMATH Keywords

indifference graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

NP-completeness of edge-colouring some restricted graphs

0 references

0 references

A linear-time algorithm for proper interval graph recognition

0 references

Two conjectures on edge-colouring

0 references

The chromatic index of complete multipartite graphs

0 references

The NP-Completeness of Edge-Coloring

0 references

Characterizing and edge-colouring split-indifference graphs

0 references

Odd Minimum Cut-Sets and <i>b</i>-Matchings

0 references

The chromatic index of graphs with a spanning star

0 references

The chromatic index of graphs with large maximum degree

0 references

On the compatibility between a graph and a simple order

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0304-3975(96)00264-2

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1391299

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