scientific article; zbMATH DE number 3889583

zbMATH Open0558.05055MaRDI QIDQ3222886FDOQ3222886

Authors: Michel Burlet, Jean Fonlupt 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3878985
• Holes and dominoes in Meyniel graphs
• Coloring Meyniel graphs in linear time
• On a conjecture of Meyniel
• An \(O(n^2)\) algorithm to color Meyniel graphs

zbMATH Keywords

polynomial-time recognition algorithmtriangulated graphsMeyniel graphparity graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cited In (28)

• Coloring Meyniel graphs in linear time
• The anti-join composition and polyhedra
• The maximum clique problem
• Recognition of quasi-Meyniel graphs
• Decomposition of perfect graphs
• Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
• On slim graphs, even pairs, and star-cutsets
• Graphs of separability at most 2
• Coloring vertices of a graph or finding a Meyniel obstruction
• Strong cliques in vertex‐transitive graphs
• An \(O(n^2)\) algorithm to color Meyniel graphs
• On kernels in i-triangulated graphs
• Title not available (Why is that?)
• On a conjecture of Meyniel
• Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
• Holes and dominoes in Meyniel graphs
• Paw-free graphs
• Polyhedral consequences of the amalgam operation
• Recognizing bull-free perfect graphs
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• Recognizing claw-free perfect graphs
• Compositions for perfect graphs
• Star-cutsets and perfect graphs
• Some properties of minimal imperfect graphs
• Erdős-Hajnal for cap-free graphs
• A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
• Alternating orientation and alternating colouration of perfect graphs
• Minimal antichains in well-founded quasi-orders with an application to tournaments

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222886)