scientific article; zbMATH DE number 3259770
From MaRDI portal
Publication:5545841
zbMath0162.27605MaRDI QIDQ5545841
Publication date: 1967
Full work available at URL: http://www.numdam.org/item?id=AIHPB_1967__3_4_433_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
On the \(k\)-edge magic graphs ⋮ On the chromatic index of multigraphs and a conjecture of Seymour (I) ⋮ A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ Obstructions for partitioning into forests and outerplanar graphs ⋮ Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ On connected graphs having the maximum connective eccentricity index ⋮ Fault diameter of product graphs ⋮ Large survivable nets and the generalized prisms ⋮ Cycle interpolation properties of graphs ⋮ Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I ⋮ Biased graphs. VII: Contrabalance and antivoltages ⋮ Designing networks with compact routing tables ⋮ A parallelizable lexicographically first maximal edge-induced subgraph problem ⋮ Adjoints of binary matroids ⋮ Hamiltonicity in locally finite graphs: two extensions and a counterexample ⋮ On natural isomorphisms of cycle permutation graphs ⋮ Light graphs in families of outerplanar graphs ⋮ Outerplanarity without accumulation in the cylinder and the Möbius band ⋮ Wiener indices of maximal \(k\)-degenerate graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ On the characteristic polynomial of homeomorphic images of a graph ⋮ Strong chromatic index of \(K_4\)-minor free graphs ⋮ Forbidden induced subgraphs ⋮ Geodesic geometry on graphs ⋮ 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs ⋮ RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties ⋮ Vulnerability of super edge-connected networks ⋮ Convex and weakly convex domination in prism graphs ⋮ Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs ⋮ A note on a conjecture of star chromatic index for outerplanar graphs ⋮ Generalized laminar matroids ⋮ The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem ⋮ Bipartite minors ⋮ On \(k\)-edge-magic labelings of maximal outerplanar graphs ⋮ Total domination in maximal outerplanar graphs. II. ⋮ Coloring the square of a \(K_{4}\)-minor free graph ⋮ \(b\)-colouring outerplanar graphs with large girth ⋮ Hamilton-connectivity of interconnection networks modeled by a product of graphs ⋮ Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs ⋮ Planar median graphs and cubesquare-graphs ⋮ Distance and connectivity measures in permutation graphs ⋮ On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions ⋮ Polynomial-time algorithms for special cases of the maximum confluent flow problem ⋮ Chromatic automorphisms and symmetries of some graphs ⋮ Edge-connectivity of permutation hypergraphs ⋮ On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees ⋮ Chromatic bounds on orbital chromatic roots ⋮ Non-separating planar graphs ⋮ Delta-wye reduction of almost-planar graphs ⋮ Connected permutation graphs ⋮ On metric dimension of permutation graphs ⋮ Transitive multipermutation graphs: Case \(4\leq n\leq m\) ⋮ Contractible edges in 2-connected locally finite graphs ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ Broken circuit complexes of series-parallel networks ⋮ 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs ⋮ Connectivity measures in matched sum graphs ⋮ Algorithm on rainbow connection for maximal outerplanar graphs ⋮ The connectivity of generalized graph products ⋮ Light paths and edges in families of outer-1-planar graphs ⋮ Isomorphism classes of cycle permutation graphs ⋮ Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity ⋮ Survey article: consequences of some outerplanarity extensions ⋮ Domination of generalized Cartesian products ⋮ Polynomial time algorithm for min-ranks of graphs with simple tree structures ⋮ Note to the paper of Grünbaum on acyclic colorings ⋮ Outer-embeddability in certain pseudosurfaces arising from three spheres ⋮ The fractional metric dimension of permutation graphs ⋮ Distance degree regular graphs and distance degree injective graphs: an overview ⋮ Boundary-type sets in maximal outerplanar graphs ⋮ Characterization problems for graphs, partially ordered sets, lattices, and families of sets ⋮ Homotopy type of circle graph complexes motivated by extreme Khovanov homology ⋮ On the broadcast domination number of permutation graphs ⋮ Characterizations of outerplanar graphs ⋮ On random trees obtained from permutation graphs ⋮ On the geodetic number of permutation graphs ⋮ Perfect domination sets in Cayley graphs ⋮ 2-connecting outerplanar graphs without blowing up the pathwidth ⋮ On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs ⋮ Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion) ⋮ Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees ⋮ Normal 6-edge-colorings of some bridgeless cubic graphs ⋮ Graphs with forbidden subgraphs ⋮ Structure and recognition of graphs with no 6-wheel subdivision ⋮ On complete systems of automata ⋮ Algorithms and obstructions for linear-width and related search parameters ⋮ The characterization of graphs with no 2-connected spanning subgraph of \(V_8\) as a minor ⋮ On the distinguishing number of functigraphs ⋮ Locating-dominating sets of functigraphs ⋮ Edge-partition and star chromatic index ⋮ Generalized Petersen graphs which are cycle permutation graphs ⋮ The distance orientation problem ⋮ Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size ⋮ On the genus of a graph related to the join of subgroups of finite abelian group ⋮ Large graphs with given degree and diameter. II ⋮ On the annihilator graph of a commutative ring ⋮ Variations on a theme of Kuratowski ⋮ On cycle permutation graphs ⋮ Connectivity of generalized prisms over G
Cites Work
This page was built for publication:
