Maximal cliques in \P₂ P₃,C₄\-free graphs

DOI10.1016/J.DISC.2010.08.005zbMATH Open1221.05258OpenAlexW117829114MaRDI QIDQ712269FDOQ712269

Authors: T. Karthick, S. A. Choudum 

Publication date: 28 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.08.005

Recommendations

• The class of \((P_7, C_4, C_5)\)-free graphs: decomposition, algorithms, and \(\chi \)-boundedness
• scientific article; zbMATH DE number 2186978
• Colouring of \((P_3 \cup P_2)\)-free graphs
• Linearly \(\chi \)-bounding \((P_6, C_4)\)-free graphs
• THE CHROMATIC NUMBER OF -FREE GRAPHS

zbMATH Keywords

chromatic numbermaximal cliques\(C_{4}\)-free graphsChordal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Efficient graph representations
• Independent sets in extensions of 2\(K_{2}\)-free graphs
• Incidence matrices and interval graphs
• A characterization of perfect graphs
• On cliques in graphs
• The strong perfect graph theorem
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• Dominating sets for split and bipartite graphs
• Title not available (Why is that?)
• On diameters and radii of bridged graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(K_{1,3}\)-free and \(W_4\)-free graphs
• Complexity results on graphs with few cliques
• Triangulated neighborhoods in even-hole-free graphs

Cited In (19)

• The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
• Colouring of \((P_3 \cup P_2)\)-free graphs
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Chromatic bounds for some classes of \(2 K_2\)-free graphs
• On the chromatic number of (\(P_6\), diamond)-free graphs
• The class of \((P_7, C_4, C_5)\)-free graphs: decomposition, algorithms, and \(\chi \)-boundedness
• Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph
• Vizing bound for the chromatic number on some graph classes
• The maximum number of 3- and 4-cliques within a planar maximally filtered graph
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)
• On indicated coloring of lexicographic product of graphs
• Indicated coloring of the Mycielskian of some families of graphs
• Title not available (Why is that?)
• Square-Free Graphs with No Six-Vertex Induced Path
• Cliques in the union of graphs
• Title not available (Why is that?)
• Regularity of binomial edge ideals of chordal graphs
• Cliques in \(C_4\)-free graphs of large minimum degree

This page was built for publication: Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs

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