z-logo
Premium
Perfect Graphs with No Balanced Skew‐Partition are 2‐Clique‐Colorable
Author(s) -
Penev Irena
Publication year - 2016
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21870
Subject(s) - combinatorics , perfect graph , mathematics , perfect graph theorem , strong perfect graph theorem , split graph , discrete mathematics , clique number , trivially perfect graph , chordal graph , clique graph , block graph , graph , line graph , pathwidth , graph power , 1 planar graph

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom