The following pages link to Carl Feghali (Q322235):
Displayed 50 items.
- Paths between colourings of sparse graphs (Q1621073) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Paths between colourings of graphs with bounded tree-width (Q1721933) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- An Erdős-Ko-Rado theorem for unions of length 2 paths (Q2005709) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- A Thomassen-type method for planar graph recoloring (Q2033925) (← links)
- A short proof of Talbot's theorem for intersecting separated sets (Q2066007) (← links)
- A note on matching-cut in \(P_t\)-free graphs (Q2094374) (← links)
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem (Q2107760) (← links)
- The maximum sum of sizes of cross-intersecting families of subsets of a set (Q2166267) (← links)
- Mixing colourings in \(2K_2\)-free graphs (Q2166319) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- Reconfiguring colorings of graphs with bounded maximum average degree (Q2222045) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations (Q2319700) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← links)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
- A Reconfigurations Analogue of Brooks’ Theorem (Q2922616) (← links)
- Enclosings of decompositions of complete multigraphs in 2‐factorizations (Q4685298) (← links)
- Intersecting families, signed sets, and injection (Q5109063) (← links)
- Toward Cereceda's conjecture for planar graphs (Q5110690) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- (Q5875577) (← links)
- Recoloring Planar Graphs of Girth at Least Five (Q5883290) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5890904) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5919358) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5965525) (← links)
- Kempe equivalence of 4‐critical planar graphs (Q6047640) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- 1-extendability of independent sets (Q6119830) (← links)
- Dirac's theorem on chordal graphs implies Brooks' theorem (Q6136675) (← links)
- Solution to a problem of Katona on counting cliques of weighted graphs (Q6145819) (← links)
- Strengthening a Theorem of Meyniel (Q6158364) (← links)
- Another Proof of Euler’s Circuit Theorem (Q6189659) (← links)
- Decomposing a triangle-free planar graph into a forest and a subcubic forest (Q6189685) (← links)
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs (Q6201337) (← links)
- Intersecting non-uniform families containing subfamilies (Q6295804) (← links)
- The Erd\H{o}s-Ko-Rado property of trees of depth two (Q6309574) (← links)
- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest (Q6323047) (← links)
- On the Hilton-Spencer intersection theorems for unions of cycles (Q6324083) (← links)
- A note on Matching-Cut in $P_t$-free Graphs (Q6383772) (← links)
- Recolouring planar graphs of girth at least five (Q6384567) (← links)
- Matching Cuts in Graphs of High Girth and H-Free Graphs (Q6421514) (← links)
- Kempe Classes and Almost Bipartite Graphs (Q6429821) (← links)