On a problem of a. kotzig concerning factorizations of 4‐regular graphs

DOI10.1002/jgt.3190080212zbMath0623.05048WikidataQ114236098 ScholiaQ114236098MaRDI QIDQ5903419

Charles Delorme

Publication date: 1985

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190080212

zbMATH Keywords

constructions; bipartite graphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C99: Graph theory

Related Items

Unnamed Item, The degree-diameter problem for sparse graph classes, On large \((\Delta ,D)\)-graphs, Largest planar graphs of diameter two and fixed maximum degree, Large graphs with given degree and diameter. II, A lower bound for the spectral radius of graphs with fixed diameter, Connections between two cycles --- a new design of dense processor interconnection networks, Graphs on alphabets as models for large interconnection networks, Table of large \(({\Delta{}}, D)\)-graphs, A note on large graphs of diameter two and given maximum degree, Diameter vulnerability of GC graphs, Asymptotically approaching the Moore bound for diameter three by Cayley graphs, Superfluous edges and exponential expansions of de Bruijn and Kautz graphs, Large planar graphs with given diameter and maximum degree, Bipartite graphs and digraphs with maximum connectivity, Trade-offs among degree, diameter, and number of paths, Approximate Moore graphs are good expanders, Asymptotically large (\(\Delta,D\))-graphs, The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs