scientific article; zbMATH DE number 3259770
From MaRDI portal
Publication:5545841
Cites work
Cited in
(only showing first 100 items - show all)- Structure and recognition of graphs with no 6-wheel subdivision
- On the chromatic index of multigraphs and a conjecture of Seymour (I)
- Designing networks with compact routing tables
- A parallelizable lexicographically first maximal edge-induced subgraph problem
- Adjoints of binary matroids
- On natural isomorphisms of cycle permutation graphs
- Transitive multipermutation graphs: Case \(4\leq n\leq m\)
- Isomorphism classes of cycle permutation graphs
- Note to the paper of Grünbaum on acyclic colorings
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Characterizations of outerplanar graphs
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
- On the characteristic polynomial of homeomorphic images of a graph
- Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- Distance and connectivity measures in permutation graphs
- On complete systems of automata
- Algorithms and obstructions for linear-width and related search parameters
- Hamiltonicity in locally finite graphs: two extensions and a counterexample
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions
- The connectivity of generalized graph products
- Light paths and edges in families of outer-1-planar graphs
- Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
- Homotopy type of circle graph complexes motivated by extreme Khovanov homology
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Large survivable nets and the generalized prisms
- Cycle interpolation properties of graphs
- 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
- Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees
- The characterization of graphs with no 2-connected spanning subgraph of \(V_8\) as a minor
- The distance orientation problem
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
- On the annihilator graph of a commutative ring
- Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs
- On connected graphs having the maximum connective eccentricity index
- Graph \(r\)-hued colorings -- a survey
- A note on a conjecture of star chromatic index for outerplanar graphs
- On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees
- Non-separating planar graphs
- Polynomial time algorithm for min-ranks of graphs with simple tree structures
- On the broadcast domination number of permutation graphs
- Normal 6-edge-colorings of some bridgeless cubic graphs
- On the distinguishing number of functigraphs
- Locating-dominating sets of functigraphs
- Edge-partition and star chromatic index
- On the genus of a graph related to the join of subgroups of finite abelian group
- Biased graphs. VII: Contrabalance and antivoltages
- Strong chromatic index of K₄-minor free graphs
- Forbidden induced subgraphs
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
- Convex and weakly convex domination in prism graphs
- Generalized laminar matroids
- Polynomial-time algorithms for special cases of the maximum confluent flow problem
- Connected permutation graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Graphs with forbidden subgraphs
- Variations on a theme of Kuratowski
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs
- Wiener indices of maximal \(k\)-degenerate graphs
- Geodesic geometry on graphs
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem
- Hamilton-connectivity of interconnection networks modeled by a product of graphs
- Planar median graphs and cubesquare-graphs
- Defective incidence coloring of graphs
- On the \(k\)-edge magic graphs
- The Tutte polynomial characterizes simple outerplanar graphs
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
- Disjunctive total domination in permutation graphs
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
- Classification of edge-critical underlying absolute planar cliques for signed graphs
- Infinite graph embeddings on tubular surfaces
- Highly connected star product graphs
- Legally \((\varDelta +2)\)-coloring bipartite outerplanar graphs in cubic time
- Outerplanarity without accumulation in the cylinder and the Möbius band
- scientific article; zbMATH DE number 3654154 (Why is no real title available?)
- Vulnerability of super edge-connected networks
- Kuratowski's theorem
- \(b\)-colouring outerplanar graphs with large girth
- On the classification and toughness of generalized permutation star-graphs
- Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
- Edge-connectivity of permutation hypergraphs
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Chromatic bounds on orbital chromatic roots
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
- Delta-wye reduction of almost-planar graphs
- On metric dimension of permutation graphs
- Contractible edges in 2-connected locally finite graphs
- Some graph theoretical aspects of generalized truncations
- On the fixing number of functigraphs
- Broken circuit complexes of series-parallel networks
- The Sierpiński product of graphs
- A dichotomy result for cyclic-order traversing games
- 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs
- An improved fixed-parameter algorithm for one-page crossing minimization
- Classical Ising model test for quantum circuits
- MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
- Algorithm on rainbow connection for maximal outerplanar graphs
- scientific article; zbMATH DE number 7090175 (Why is no real title available?)
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)