Lambda composition

DOI10.1002/(SICI)1097-0118(199709)26:1%3C9::AID-JGT2%3E3.0.CO;2-NMaRDI QIDQ4355067zbMATH OpenOpenAlexFDO

Authors Kathie Cameron, Jack Edmonds

Publication date 7 December 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199709)26:1%3C9::aid-jgt2%3E3.0.co;2-n

zbMATH Keywords

comparability graphdecompositionlambda subgraphperfect graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• All minimal prime extensions of hereditary classes of graphs
• Extension of hereditary classes with substitutions
• On the closure of graphs under substitution
• scientific article; zbMATH DE number 2147925
• scientific article; zbMATH DE number 3887730

Cited in

(40)

• Perfect couples of graphs
• All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
• Monochromatic subgraphs in the absence of a properly colored 4-cycle
• Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
• Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
• Ramsey and Gallai-Ramsey numbers for the union of paths and stars
• Ramsey and Gallai-Ramsey number for wheels
• Gallai-Ramsey numbers for rainbow P₅ and monochromatic fans or wheels
• Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
• Gallai-Ramsey numbers for books
• Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
• Complete edge-colored permutation graphs
• Gallai-Ramsey number for the union of stars
• Star-critical Gallai-Ramsey numbers of graphs
• Gallai-Ramsey numbers for fans
• Disconnected colors in generalized Gallai-colorings
• Improved upper bounds for Gallai-Ramsey numbers of paths and cycles
• Gallai colorings and domination in multipartite digraphs
• Gallai-Ramsey number of an 8-cycle
• Gallai-Ramsey numbers involving a rainbow 4-path
• Rainbow generalizations of Ramsey theory: A survey
• Complete bipartite graphs without small rainbow stars
• Size Gallai-Ramsey number
• Complete bipartite graphs without small rainbow subgraphs
• Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles
• On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
• Minimum-degree conditions for rainbow triangles
• Ramsey and Gallai-Ramsey numbers for comb and sun graphs
• More on discrete convexity
• Ramsey and Gallai-Ramsey numbers for multiple triangles of graphs and their multiplicities
• Ordered Gallai-Ramsey numbers
• Ramsey and Gallai-Ramsey numbers for forests
• Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs
• Gallai-Ramsey numbers for three graphs on at most five vertices
• Ramsey and Gallai-Ramsey numbers of cycles and books
• Ramsey numbers avoiding properly colored cycles
• Gallai-Ramsey numbers for rainbow trees and monochromatic double stars or books
• Colored graphs without colorful cycles
• Not complementary connected and not CIS d-graphs form weakly monotone families
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited

This page was built for publication: Lambda composition

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