On circular-perfect graphs: a survey (Q2225429): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2020.103224 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3081683860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theta number of powers of cycle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex-round graphs are circular-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free strongly circular-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular-imperfection of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density of the circular chromatic numbers of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal circular-imperfect graphs of large clique number and large independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of minimal circular-imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time computability of some graph parameters for superclasses of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing clique and chromatic number of circular-perfect graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Perfection: Computational Results for Superclasses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the clique number of \(a\)-perfect graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three classes of minimal circular-imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw‐free circular‐perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Lehman's theorems to packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antiwebs are rank-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rank-perfect subclasses of near-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on circular perfect graphs and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimally circular-imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic numbers and products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424895 / rank
 
Normal rank

Latest revision as of 13:26, 24 July 2024

scientific article
Language Label Description Also known as
English
On circular-perfect graphs: a survey
scientific article

    Statements

    On circular-perfect graphs: a survey (English)
    0 references
    0 references
    0 references
    8 February 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    circular chromatic number
    0 references
    circular clique
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references