Coloring Meyniel graphs in linear time (Q3439304)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Coloring Meyniel graphs in linear time	scientific article

Statements

scholarly article

0 references

Coloring Meyniel graphs in linear time (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.endm.2005.06.005

0 references

Benjamin Lévêque

0 references

Frédéric Maffray

0 references

Electronic Notes in Discrete Mathematics

0 references

publication date

29 May 2007

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

perfect graphs

0 references

Meyniel graphs

0 references

coloring

0 references

algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.endm.2005.06.005

0 references

0 references

New methods to color the vertices of a graph

0 references

0 references

0 references

Transformations which Preserve Perfectness and H-Perfectness of Graphs

0 references

A fast algorithm for coloring Meyniel graphs

0 references

Connected sequential colourings

0 references

On a conjecture of Meyniel

0 references

0 references

0 references

Algorithmic Aspects of Vertex Elimination on Graphs

0 references

HOLES AND DOMINOES IN MEYNIEL GRAPHS

0 references

An \(O(n^2)\) algorithm to color Meyniel graphs

0 references

Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3439304

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