On -sparse graphs and other families

DOI10.1016/J.ENDM.2004.03.032zbMATH Open1152.05362OpenAlexW1514704511MaRDI QIDQ3439147FDOQ3439147

Authors: Jean-Luc Fouquet, Jean-Marie Vanherpe 

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.032

Mathematics Subject Classification ID

Approximation algorithms (68W25) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• Dominating cliques in \(P_ 5\)-free graphs
• Title not available (Why is that?)
• On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
• Four classes of perfectly orderable graphs
• Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
• A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
• Title not available (Why is that?)
• On graphs with limited number of \(P_{4}\)-partners

This page was built for publication: On -sparse graphs and other families

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