On graphs without P_ 5 and P_ 5

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Recommendations

On the chromatic number of $(P_{5},K_{2,t})$-free graphs
Coloring of $(P_5, 4$-wheel)-free graphs
The class of $(P_7, C_4, C_5)$-free graphs: decomposition, algorithms, and $\chi $-boundedness
On the chromatic number of (P5,dart)-free graphs
On graphs with no induced five‐vertex path or paraglider

Cites work

scientific article; zbMATH DE number 3708283 (Why is no real title available?)
scientific article; zbMATH DE number 3632548 (Why is no real title available?)
scientific article; zbMATH DE number 4183452 (Why is no real title available?)
A decomposition for a class of $(P_ 5,\overline{P}_ 5)$-free graphs
A new property of critical imperfect graphs and some consequences
Graphs with no induced $C_ 4$ and $2K_ 2$
Incidence matrices and interval graphs
On brittle graphs
Prime Testing for the Split Decomposition of a Graph

Cited in

(55)

On-line graph coloring of ${\mathbb{P}_5}$-free graphs
No odd pairs in minimal imperfect NP${}_{5}$ graphs.
Maximal cliques in $\{P_{2} \cup P_{3},C_{4}\}$-free graphs
On the chromatic number of some $P_5$-free graphs
Chromatic bounds for the subclasses of pK₂-free graphs
GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
Polynomial-time algorithms for minimum weighted colorings of $(P_5, \overline{P}_5)$-free graphs and similar graph classes
First-fit coloring of $\{P_{5},K_{4}-e\}$-free graphs
Coloring of $(P_5, 4$-wheel)-free graphs
Structural domination and coloring of some $( P_7 , C_7)$-free graphs
Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs
Chromatic number of $P_5$-free graphs: Reed's conjecture
On the chromatic number of $2 K_2$-free graphs
Polynomial $\chi $-binding functions and forbidden induced subgraphs: a survey
Bounding $\chi $ in terms of $\omega $ and $\varDelta $ for some classes of graphs
Sequential $NP_5, IP_5, MP_5$ graphs
Chromatic bounds for some classes of 2 K₂-free graphs
On the stable set problem in special $P_{5}$-free graphs
The class of $(P_7, C_4, C_5)$-free graphs: decomposition, algorithms, and $\chi $-boundedness
Stability in $P_5$- and banner-free graphs
On minimal imperfect graphs without induced P₅
Independent sets in extensions of 2$K_{2}$-free graphs
The stable set polytope for some extensions of $P_4$-free graphs
Coloring ($P_5$, kite)-free graphs with small cliques
Local transformations of graphs preserving independence number
Vizing bound for the chromatic number on some graph classes
Star chromatic bounds
Star coloring of certain graph classes
Some observations on maximum weight stable sets in certain $P_{5}$-free graphs
Stable sets in certain $P_6$-free graphs
On the structure and stability number of $P_{5}$- and co-chair-free graphs
A Generalization of $$\chi $$-Binding Functions
Homogeneous sets, clique-separators, critical graphs, and optimal $\chi$-binding functions
On color-critical ($P_5$,$\operatorname{co-}P_5$)-free graphs
Reconfiguration of vertex colouring and forbidden induced subgraphs
Linear chromatic bounds for a subfamily of $3K_{1}$-free graphs
Maximum independent sets in subclasses of $P_{5}$-free graphs
The chromatic number of ($P_5$, HVN)-free graphs
On the chromatic number of $(P_{5},K_{2,t})$-free graphs
Edge-maximal graphs without $\theta_5$-graphs.
Coloring graphs without induced $P_5$ or $K_5-e$
Improved bounds on the chromatic number of ($P_5$, flag)-free graphs
On semi-$P_ 4$-sparse graphs
Bounds for the chromatic number of some $pK_2$-free graphs
scientific article; zbMATH DE number 6867904 (Why is no real title available?)
On the chromatic number of $P_5$-free graphs with no large intersecting cliques
On graphs with no induced five‐vertex path or paraglider
Weighted parameters in $(P_5,\overline {P_5})$-free graphs
Stability number of bull- and chair-free graphs revisited
Coloring graphs with no induced five‐vertex path or gem
Colouring Graphs with Prescribed Induced Cycle Lengths
A tight linear bound to the chromatic number of $(P_5, K_1 +(K_1 \cup K_3))$-free graphs
Some results on maximum stable sets in certain $P_{5}$-free graphs
On the chromatic number of (P_{5},windmill)-free graphs
Divisibility and coloring of some $P_5$-free graphs

This page was built for publication: On graphs without $P_ 5$ and $\overline {P}_ 5$

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