Treffer: On the quasi-locally paw-free graphs
Title:
On the quasi-locally paw-free graphs
Authors:
Source:
The 18th British Combinatorial ConferenceDiscrete mathematics. 266(1-3):37-40
Publisher Information:
Amsterdam: Elsevier, 2003.
Publication Year:
2003
Physical Description:
print, 5 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Coloration graphe, Graph colouring, Coloración grafo, Combinatoire, Combinatorics, Combinatoria, Préférence patte, Paw preference, Preferencia pata, Théorie graphe, Graph theory, Teoría grafo, Algorithme combinatoire polynomial, Polynomial combinatorial algorithm, Conjecture forte graphe parfait, Strong perfect graph conjecture, Graphe parfait, Perfect graph, Graphe patte libre quasi localement, Quasi locally paw free graph
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Laboratoire LAID3, Département de Recherche Opérationnelle, Faculté des Mathématiques, USTHB, El Alia BP 32, 16111 Bab Ezzouar Alger, Algeria
ISSN:
0012-365X
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.14786415
Database:
PASCAL Archive
Weitere Informationen
In this paper, we present a new class of graphs named quasi-locally paw-free (QLP) graphs. We prove the strong perfect graph conjecture for a subclass of QLP class, by exhibiting a polynomial combinatorial algorithm for ω-coloring any Berge graph for this subclass. This subclass contains K4-free graphs and chordal graphs.