Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs

DOI10.1016/j.disc.2010.08.005zbMath1221.05258OpenAlexW117829114MaRDI QIDQ712269

T. Karthick, Sheshayya 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

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)

Related Items

Vizing bound for the chromatic number on some graph classes ⋮ On indicated coloring of lexicographic product of graphs ⋮ On the chromatic number of (\(P_6\), diamond)-free graphs ⋮ The complexity of connected dominating sets and total dominating sets with specified induced subgraphs ⋮ Indicated coloring of the Mycielskian of some families of graphs ⋮ 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 ⋮ Regularity of binomial edge ideals of chordal graphs ⋮ On indicated coloring of some classes of graphs ⋮ Square-Free Graphs with No Six-Vertex Induced Path

Cites Work

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