Square-free perfect graphs. (Q1426100)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Square-free perfect graphs.	scientific article

Statements

scholarly article

0 references

Square-free perfect graphs. (English)

0 references

Michele Conforti

0 references

Kristina Vušković

0 references

Cornuéjols, Gérard

0 references

Journal of Combinatorial Theory. Series B

0 references

publication date

14 March 2004

0 references

full work available at URL

http://eprints.whiterose.ac.uk/74358/2/squarefree.pdf

0 references

MaRDI profile type

MaRDI publication profile

0 references

The strong perfect graph theorem

0 references

Star-cutsets and perfect graphs

0 references

Recognizing Dart-Free Perfect Graphs

0 references

Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs

0 references

A mickey-mouse decomposition theorem

0 references

Even-hole-free graphs part I: Decomposition theorem

0 references

Balanced \(0,\pm 1\) matrices. I: Decomposition

0 references

Balanced \(0,\pm 1\) matrices. II: Recognition algorithm

0 references

Decomposition of balanced matrices

0 references

A theorem of Truemper

0 references

Structural properties and decomposition of linear balanced matrices

0 references

Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets

0 references

Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations

0 references

Combinatorial Optimization

0 references

Compositions for perfect graphs

0 references

Some properties of minimal imperfect graphs

0 references

0 references

On the perfect graph conjecture

0 references

0 references

Paw-free graphs

0 references

The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs

0 references

On a property of the class of n-colorable graphs

0 references

Alpha-balanced graphs and matrices and GF(3)-representability of matroids

0 references

Critical perfect graphs and perfect 3-chromatic graphs

0 references

Coloring perfect \((K_ 4\)-e)-free graphs

0 references

0 references

0 references

On a class of square-free graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.jctb.2003.08.003

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

journals/jct/ConfortiCV04

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1426100

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