Pages that link to "Item:Q1801686"
From MaRDI portal
The following pages link to Graphs with no induced \(C_ 4\) and \(2K_ 2\) (Q1801686):
Displaying 39 items.
- On realization graphs of degree sequences (Q284753) (← links)
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Star chromatic bounds (Q327688) (← links)
- Star coloring of graphs with girth at least five (Q343773) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Hereditary unigraphs and Erdős-Gallai equalities (Q389468) (← links)
- On fractional realizations of graph degree sequences (Q405210) (← links)
- Non-minimal degree-sequence-forcing triples (Q497308) (← links)
- Some good characterization results relating to the Kőnig-Egerváry theorem (Q623797) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Chromatic bounds for the subclasses of \(pK_2\)-free graphs (Q831732) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Linear recognition of pseudo-split graphs (Q1331889) (← links)
- On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Powers of ideals associated to \((C_{4},2K_{2})\)-free graphs (Q1730861) (← 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)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q1827854) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\) (Q1903716) (← links)
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets (Q2064297) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs (Q2118240) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- Graph classes with linear Ramsey numbers (Q2659214) (← links)
- The structure of graphs with forbidden induced $C_4$, $\overline{C}_4$, $C_5$, $S_3$, chair and co-chair (Q5009982) (← links)
- Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
- Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs (Q6136471) (← links)
- Indicated coloring of the Mycielskian of some families of graphs (Q6174150) (← links)
- Near optimal colourability on hereditary graph families (Q6196836) (← links)
- Split graphs and block representations (Q6197725) (← links)
- Reconfiguration of vertex colouring and forbidden induced subgraphs (Q6201889) (← links)
