Pages that link to "Item:Q5903419"

The following pages link to On a problem of a. kotzig concerning factorizations of 4‐regular graphs (Q5903419):

Displaying 19 items.

• The degree-diameter problem for sparse graph classes (Q491538) (← links)
• On large \((\Delta ,D)\)-graphs (Q685678) (← links)
• Largest planar graphs of diameter two and fixed maximum degree (Q686482) (← links)
• Large graphs with given degree and diameter. II (Q793749) (← links)
• A lower bound for the spectral radius of graphs with fixed diameter (Q992783) (← links)
• Connections between two cycles --- a new design of dense processor interconnection networks (Q1199411) (← links)
• Graphs on alphabets as models for large interconnection networks (Q1199426) (← links)
• Table of large \(({\Delta{}}, D)\)-graphs (Q1199460) (← links)
• A note on large graphs of diameter two and given maximum degree (Q1272472) (← links)
• Diameter vulnerability of GC graphs (Q1408451) (← links)
• Asymptotically approaching the Moore bound for diameter three by Cayley graphs (Q1633751) (← links)
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs (Q1827806) (← links)
• Large planar graphs with given diameter and maximum degree (Q1897359) (← links)
• Bipartite graphs and digraphs with maximum connectivity (Q1923586) (← links)
• Trade-offs among degree, diameter, and number of paths (Q2112655) (← links)
• Approximate Moore graphs are good expanders (Q2284745) (← links)
• Asymptotically large (\(\Delta,D\))-graphs (Q2576342) (← links)
• The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs (Q2874093) (← links)
• (Q5009641) (← links)