AbstractPartial cubes as well as planar graphs have been extensively investigated. In this note we introduce an additional topological kind of condition to the Chepoi’s expansion procedure that characterizes planar partial cubes. As a consequence we obtain a characterization of some other planar subclasses of partial cubes
Different areas of discrete mathematics lead to intrinsically different characterizations of planar ...
AbstractWe define a completion of a netlike partial cube G by replacing each convex 2n-cycle C of G ...
AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained f...
AbstractPartial cubes as well as planar graphs have been extensively investigated. In this note we i...
Partial cubes have been extensively investigated as well as planar graphs. In this note we introduce...
V preteklih letih so bile opravljene mnoge raziskave delnih kock, kot tudi ravninskih grafov. V Član...
AbstractPartial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means ...
International audienceIn this note we determine the set of expansions such that a partial cube is pl...
International audienceIn this note we determine the set of expansions such that a partial cube is pl...
AbstractPartial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means ...
AbstractStructural properties of isometric subgraphs of Hamming graphs are presented, generalizing c...
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semic...
AbstractDifferent areas of discrete mathematics lead to instrinsically different characterizations o...
Different areas of discrete mathematics lead to intrinsically different characterizations of planar ...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
Different areas of discrete mathematics lead to intrinsically different characterizations of planar ...
AbstractWe define a completion of a netlike partial cube G by replacing each convex 2n-cycle C of G ...
AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained f...
AbstractPartial cubes as well as planar graphs have been extensively investigated. In this note we i...
Partial cubes have been extensively investigated as well as planar graphs. In this note we introduce...
V preteklih letih so bile opravljene mnoge raziskave delnih kock, kot tudi ravninskih grafov. V Član...
AbstractPartial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means ...
International audienceIn this note we determine the set of expansions such that a partial cube is pl...
International audienceIn this note we determine the set of expansions such that a partial cube is pl...
AbstractPartial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means ...
AbstractStructural properties of isometric subgraphs of Hamming graphs are presented, generalizing c...
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semic...
AbstractDifferent areas of discrete mathematics lead to instrinsically different characterizations o...
Different areas of discrete mathematics lead to intrinsically different characterizations of planar ...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
Different areas of discrete mathematics lead to intrinsically different characterizations of planar ...
AbstractWe define a completion of a netlike partial cube G by replacing each convex 2n-cycle C of G ...
AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained f...
DOI
Add to ORKG