Pages that link to "Item:Q712269"
From MaRDI portal
The following pages link to Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269):
Displaying 11 items.
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700) (← links)
- Regularity of binomial edge ideals of chordal graphs (Q2044164) (← links)
- On indicated coloring of lexicographic product of graphs (Q2161277) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- On indicated coloring of some classes of graphs (Q5919702) (← links)
- Indicated coloring of the Mycielskian of some families of graphs (Q6174150) (← links)
