Quadratic leaves of maximal partial triple systems

DOI10.1007/BF01788106zbMATH Open0609.05009MaRDI QIDQ1086567FDOQ1086567

Authors: Charles J. Colbourn, Alexander Rosa 

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4053628
• scientific article; zbMATH DE number 4041929
• scientific article; zbMATH DE number 4068926
• scientific article; zbMATH DE number 89393
• scientific article; zbMATH DE number 3655

zbMATH Keywords

Langford sequencesmaximal partial triple system

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Embedding Partial Steiner Triple Systems
• Every generalized Petersen graph has a Tait coloring
• Title not available (Why is that?)
• Langford sequences: Perfect and hooked
• Element neighbourhoods in twofold triple systems
• Maximal consistent families of triples
• On Cyclic Steiner 2-Designs
• Completing small partial triple systems
• Embedding partial Steiner triple systems is NP-complete
• The strong chromatic number of partial triple systems
• Title not available (Why is that?)

Cited In (34)

• \(f\)-vectors of pure complexes and pure multicomplexes of rank three
• Embeddings of maximum packings in triple systems
• The spectrum of maximal partial Steiner triple systems
• Element neighbourhoods in twofold triple systems
• Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves
• Title not available (Why is that?)
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Neighborhoods in maximum packings of \(2K_n\) and quadratic leaves of triple systems
• Well-balanced designs for data placement
• Title not available (Why is that?)
• The size of 3-uniform hypergraphs with given matching number and codegree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposing graphs of high minimum degree into 4-cycles
• Block size five: quo vadis?
• The spectrum of cyclic BSEC with block size three
• Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
• Generating sets in Steiner triple systems
• Simple neighbourhoods in triple systems
• A decomposition of (λK υ)+ with extended triangles
• Forest leaves and four-cycles
• Decomposing \(K_{n} \cup P\) into triangles
• Grooming for two-period optical networks
• Directed 3-cycle decompositions of complete directed graphs with quadratic leaves
• The strong chromatic number of partial triple systems
• On a class of completable partial edge-colourings
• A class of partial triple systems with applications in survey sampling
• 4-cycle systems of \(K_n-E(F^\ast)\)
• Nesting partial Steiner triple systems with 2-regular leave graphs
• All graphs with maximum degree three whose complements have 4-cycle decompositions
• A survey of Skolem-type sequences and Rosa’s use of them
• Cubic leaves
• A solution to the forest leave problem for partial 6-cycle systems
• Group divisible designs with two associate classes, and quadratic leaves of triple systems

This page was built for publication: Quadratic leaves of maximal partial triple systems

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