scientific article; zbMATH DE number 3259770

zbMATH Open0162.27605MaRDI QIDQ5545841FDOQ5545841

Authors: Gary Chartrand, Frank Harary 

Publication date: 1967

Full work available at URL: http://www.numdam.org/item?id=AIHPB_1967__3_4_433_0

Title of this publication is not available (Why is that?)

zbMATH Keywords

topology

Cites Work

• Recent results in topological graph theory

Cited In (only showing first 100 items - show all)

• Vulnerability of super edge-connected networks
• Survey article: consequences of some outerplanarity extensions
• Kuratowski's theorem
• Obstructions for partitioning into forests and outerplanar graphs
• On the distinguishing number of functigraphs
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Connectivity measures in matched sum graphs
• On the \(k\)-edge magic graphs
• Coloring the square of a \(K_{4}\)-minor free graph
• Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
• On the edge-connectivity and restricted edge-connectivity of a product of graphs
• Outer-embeddability in certain pseudosurfaces arising from three spheres
• Homotopy type of circle graph complexes motivated by extreme Khovanov homology
• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
• Graphs with forbidden subgraphs
• Characterizations of outerplanar graphs
• Note to the paper of Grünbaum on acyclic colorings
• Light graphs in families of outerplanar graphs
• Edge-connectivity of permutation hypergraphs
• Fault diameter of product graphs
• On cycle permutation graphs
• On natural isomorphisms of cycle permutation graphs
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Infinite graph embeddings on tubular surfaces
• Connected permutation graphs
• On random trees obtained from permutation graphs
• On the geodetic number of permutation graphs
• A parallelizable lexicographically first maximal edge-induced subgraph problem
• Isomorphism classes of cycle permutation graphs
• Connectivity of generalized prisms over G
• Chromatic bounds on orbital chromatic roots
• Domination of generalized Cartesian products
• Hamiltonicity in locally finite graphs: two extensions and a counterexample
• 2-connecting outerplanar graphs without blowing up the pathwidth
• Designing networks with compact routing tables
• Maximal closed set and half-space separations in finite closure systems
• Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
• RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
• Classical Ising model test for quantum circuits
• Legally \((\varDelta +2)\)-coloring bipartite outerplanar graphs in cubic time
• The connectivity of generalized graph products
• On \(k\)-edge-magic labelings of maximal outerplanar graphs
• Generalized Petersen graphs which are cycle permutation graphs
• Distance and connectivity measures in permutation graphs
• Purity and Separation for Oriented Matroids
• Algorithms and obstructions for linear-width and related search parameters
• \(b\)-colouring outerplanar graphs with large girth
• Delta-wye reduction of almost-planar graphs
• Wiener indices of maximal \(k\)-degenerate graphs
• Large graphs with given degree and diameter. II
• Structure and recognition of graphs with no 6-wheel subdivision
• Title not available (Why is that?)
• Variations on a theme of Kuratowski
• Large survivable nets and the generalized prisms
• Bipartite minors
• On the chromatic index of multigraphs and a conjecture of Seymour (I)
• On metric dimension of permutation graphs
• Planar median graphs and cubesquare-graphs
• Contractible edges in 2-connected locally finite graphs
• Title not available (Why is that?)
• On complete systems of automata
• The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
• Biased graphs. VII: Contrabalance and antivoltages
• Broken circuit complexes of series-parallel networks
• On the characteristic polynomial of homeomorphic images of a graph
• The fractional metric dimension of permutation graphs
• 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs
• Perfect domination sets in Cayley graphs
• Algorithm on rainbow connection for maximal outerplanar graphs
• Total domination in maximal outerplanar graphs. II.
• Outerplanarity without accumulation in the cylinder and the Möbius band
• MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
• Title not available (Why is that?)
• Highly connected star product graphs
• Adjoints of binary matroids
• Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs
• Neighbor sum distinguishing index of \(K_4\)-minor free graphs
• Transitive multipermutation graphs: Case \(4\leq n\leq m\)
• Non-separating planar graphs
• Planar polynomial of the graphs
• Comparison of outerplanarity and generalized outerplanarity properties for Cayley graphs of planar semigroups
• On the genus of a graph related to the join of subgroups of finite abelian group
• Hamilton-connectivity of interconnection networks modeled by a product of graphs
• Lattice path bicircular matroids
• Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
• Edge-partition and star chromatic index
• Title not available (Why is that?)
• Distance degree regular graphs and distance degree injective graphs: an overview
• Some graph theoretical aspects of generalized truncations
• On the fixing number of functigraphs
• A survey on the Intersection graphs of ideals of rings
• Light paths and edges in families of outer-1-planar graphs
• Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
• Cycle interpolation properties of graphs
• Forbidden minors: finding the finite few
• Classification of edge-critical underlying absolute planar cliques for signed graphs
• On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees
• On connected graphs having the maximum connective eccentricity index
• Boundary-type sets in maximal outerplanar graphs
• Polynomial time algorithm for min-ranks of graphs with simple tree structures

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545841)