The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.

All cubic partial cubes (i.e., cubic isometric subgraphs of hypercubes) up to 30 vertices and all edge-critical partial cubes up to 14 vertices are presented. The lists of graphs were confirmed by computer search to be complete. Non-trivial cubic partial cubes on 36, 42, and 48 vertices are also constructed.

The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.

We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is valid to random cubic graphs as well as it improves existing lower bounds on the maximum cut in cubic graphs with large girth.

We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible cubic polynomials are completely understood, while in the irreducible cubic case, we give a family of polynomials with the bound which is the best currently known.

This paper deals with the shape preserving C rational cubic interpolation. The developed rational cubic interpolating function has only one free parameter. The approximation order of rational cubic function is investigated and range of optimal error constant is determined. Moreover, positive, constrained and monotone data preserving schemes are developed. 2000 Mathematics Subject Classification...

We study the equivalence problem of cubic forms. We lower bound its complexity by that of F-algebra isomorphism problem and hence by the graph isomorphism problem (for all fields F). For finite fields we upper bound the complexity of cubic forms by NP∩coAM. We also study the cubic forms obtained from F-algebras and show that they are regular and indecomposable.

It was conjectured by Hoffmann-Ostenhof that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. In this paper, we show that this conjecture holds for traceable cubic graphs. keywords: Cubic graph, Hoffmann-Ostenhof’s Conjecture, Traceable AMS Subject Classification: 05C45, 05C70

A graph is cubic if each of its vertex is of degree 3 and it is hamiltonian if it contains a cycle passing through all its vertices. It is known that if a cubic graph is hamiltonian, then it has at least three Hamilton cycles. This paper is about those works done concerning the number of Hamilton cycles in cubic graphs and related problems.