On a problem of a. kotzig concerning factorizations of 4‐regular graphs
From MaRDI portal
Publication:5903419
DOI10.1002/jgt.3190080212zbMath0623.05048WikidataQ114236098 ScholiaQ114236098MaRDI QIDQ5903419
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
Related Items
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, 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, Asymptotically large (\(\Delta,D\))-graphs, The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs
